백준 : 9251

https://www.acmicpc.net/problem/9251

9251번: LCS

#include<iostream>
#include<string>
#include<algorithm>
 
using namespace std;
 
string s1;
string s2;
int dp[1002][1002];
 
int main(){
    cin>>s1;
    cin>>s2;
 
    int len1 = s1.length();
    int len2 = s2.length();
 
    for(int i=0;i<len1;i++){
        for(int j=0;j<len2;j++){
            if(s1[i] == s2[j]){
                dp[i+1][j+1] = dp[i][j]+1;
            }else{
                dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j]);
            }
        }
    }
 
    cout<<dp[len1][len2]<<"\n";
 
}