题目链接:http://acm.pku.edu.cn/JudgeOnline/problem?id=1458
最长公共子序列,没什么太多可谈的
#include <iostream>
#include <string>
using namespace std;
#define MAX 1000
char str1[MAX],str2[MAX];
int i,j,len1,len2,res[MAX][MAX];
int main()
{
freopen("in.txt","r",stdin);
str1[0] = str2[0] = 1;
while(cin >> (str1 + 1) >> (str2 + 1))
{
len1 = strlen(str1);
len2 = strlen(str2);
for(i = 0;i < len1;++i)
res[i][0] = 0;
for(i = 1;i < len2;++i)
res[0][i] = 0;
for(i = 1;i < len1;++i)
{
for(j = 1;j < len2;++j)
{
if(str1[i] == str2[j])
res[i][j] = res[i-1][j-1] + 1;
else
res[i][j] = res[i-1][j] > res[i][j-1] ? res[i-1][j] : res[i][j-1];
}
}
cout << res[len1-1][len2-1] << endl;
}
return 0;
}