POJ1458 ----最长公共子序列

递归方程：

< http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcD4KPHByZSBjbGFzcz0="brush:java;">#include #include using namespace std; int main() { char a[205],b[205]; int c[205][205]; int i,j; while(cin >> a >> b) { int len_a=strlen(a),len_b=strlen(b); for(i=1; i<=len_a; i++) c[i][0]=0; for(j=1; j<=len_b; j++) c[0][j]=0; for(i=1; i<=len_a; i++) for(j=1; j<=len_b; j++) { if(a[i-1]==b[j-1]) c[i][j]=c[i-1][j-1]+1; else if(c[i-1][j]>c[i][j-1]) c[i][j]=c[i-1][j]; else c[i][j]=c[i][j-1]; } cout << c[len_a][len_b] << endl; } return 0; }