poj1458最长公共子序列

动态规划,主要是递归式子

///

#include<iostream>

#include<string>
#include<algorithm>
using namespace std;
const int MAXN = 100;
int result[MAXN][MAXN];
int main(){
string s1,s2;
while(cin>>s1>>s2){
int size1 = s1.size();
int size2 = s2.size();
int i,j;
for(i = 0;i <= size1;i++)
result[i][0] = 0;
for(j = 0;j <= size2;j++)
result[0][j] = 0;
for(i = 1;i <= size1;i++)
for(j = 1;j <= size2;j++)
{
if(s1[i - 1] == s2[j - 1])
result[i][j] = result[i - 1][j - 1] + 1;
else
result[i][j] = max(result[i - 1][j],result[i][j - 1]);
}
cout<<result[size1][size2]<<endl;;
}
}