baekjun 9251. LCS(Longest Common Sequence)

 최장공통수열찾기.  comp가 좋은 네이밍은 아닌듯

#include <iostream>
#include <algorithm>
#include <string>
 
using namespace std;
 
int comp[1001][1001];
 
int main() {
    string s1;
    string s2;
 
    cin >> s1;
    cin >> s2;
    for (int i = 0; i <= s1.size(); i++) {
        comp[i][0] = 0;
    }
    for (int i = 0; i <= s2.size(); i++) {
        comp[0][i] = 0;
    }
 
    for (int i = 1; i <= s1.size(); i++) {
        for (int j = 1; j <= s2.size(); j++) {
            if (s1[i - 1] == s2[j - 1]) {
                comp[i][j] = comp[i - 1][j - 1] + 1;
            }
            else {
                comp[i][j] = max(comp[i - 1][j], comp[i][j - 1]);
            }
        }
    }
    cout << comp[s1.size()][s2.size()] << endl;
    //system("pause");
    return 0;
}