[BAE/<JOON> 문제풀이] 9251. LCS (DP.022)

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

9251번: LCS

#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main()
{
    string a, b;
    cin >> a >> b;
    int n = a.length();
    int m = b.length();
    vector<vector<int> > dp;    
    dp.resize(n + 1);    
    dp[0].resize(m + 1);
    for (int i = 1; i <= n; i++) {
        dp[i].resize(m + 1);
        for (int j = 1; j <= m; j++) {
            if (a[i-1] == b[j-1]) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
            }
            else {
                dp[i][j] = (dp[i - 1][j] > dp[i][j - 1] ? dp[i - 1][j] : dp[i][j - 1]);
            }
        }
    }
    /*for (int i = 1; i <= n;i++) {
        for (int j = 1; j <= m;j++) {
            cout << dp[i][j] << " ";
        }
        cout << endl;
    }*/
    cout << dp[n][m];
    return 0;
}