UVa 10405 - Longest Common Subsequence

最长公共子序列

#include "iostream"#include <string>using namespace std;const int Max=1001;string a,b;int dp[Max][Max];int main(){while(getline(cin,a)){getline(cin,b);int la=a.length();int lb=b.length();for(int i=0;i<la;i++){for(int j=0;j<lb;j++){if(a[i]==b[j])dp[i+1][j+1]=dp[i][j]+1;elsedp[i+1][j+1]=dp[i+1][j]>dp[i][j+1]?dp[i+1][j]:dp[i][j+1];}}cout<<dp[la][lb]<<endl;} return 0;}