动态规划DP_最长公共子序列LCS

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define maxn 210
int dp(string a, string b) {
int max_common_len[maxn][maxn];
for (int i = 0; i < maxn; ++i)
for (int j = 0; j < maxn; j++)
{
if (i == 0)
max_common_len[i][j] = 0;
if (j == 0)
max_common_len[i][j] = 0;
}
int i , j ;
for (i = 0; i < a.size(); ++i) {
for ( j = 0; j < b.size(); ++j) {
if (a[i] == b[j]) {
max_common_len[i][j] =  max_common_len[i - 1][j - 1] + 1;
}
else
max_common_len[i][j] = max(max_common_len[i - 1][j], max_common_len[i][j - 1]);
}
}
return max_common_len[a.size() - 1][b.size() - 1];
}
int main(int argc, char const *argv[])
{
string con1, con2;
while (cin >> con1 >> con2)
cout << dp(con1, con2) << endl;
return 0;
}