You are viewing a single comment's thread. Return to all comments →
using namespace std;
int test(string s1, string s2) { int n1 = s1.length(); int n2 = s2.length(); vector> dp(n1 + 1, vector(n2 + 1, 0));
for (int i = 1; i <= n1; i++) { for (int j = 1; j <= n2; j++) { if (s1[i - 1] == s2[j - 1]) { dp[i][j] = dp[i - 1][j - 1] + 1; } else { dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]); } } } return dp[n1][n2];
}
int main() { string s1, s2; cin >> s1 >> s2; cout << test(s1, s2) << endl; return 0; }
Seems like cookies are disabled on this browser, please enable them to open this website
Common Child
You are viewing a single comment's thread. Return to all comments →
include
using namespace std;
int test(string s1, string s2) { int n1 = s1.length(); int n2 = s2.length(); vector> dp(n1 + 1, vector(n2 + 1, 0));
}
int main() { string s1, s2; cin >> s1 >> s2; cout << test(s1, s2) << endl; return 0; }