Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17499 Accepted Submission(s): 7341
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
abcfbc abfcab programming contest abcd mnp
4 2 0
这道题要求最长公共子序列,两个字符串aa,bb。用dp[i][j]表示aa的前i个字符与bb前j个字符的最长公共子序列。
也就说 如果aa[i]与bb[j]相等,那么dp[i+1][j+1]=dp[i][j]+1 吧,否则dp[i+1][j+1]=max(dp(i+1,j),dp(i,j+1));
(如果不相等 dp就要等于 aa中的前i个字符bb的j+1个字符 或者 aa中的前i+1个字符bb中前几个字符 中的较大值)
#include<iostream>
#include<string>
using namespace std;
#define max 1001
int dp[max][max];
int main()
{
string aa,bb;
int la,lb,i,j;
while(cin>>aa>>bb)
{
la=aa.length();
lb=bb.length();
for(i=0;i<la;i++)
{
for(j=0;j<lb;j++)
{
if(aa[i]==bb[j])
dp[i+1][j+1]=dp[i][j]+1;
else
dp[i+1][j+1]= dp[i][j+1]>dp[i+1][j]?dp[i][j+1]:dp[i+1][j];//dp[0][1=] dp[1][0]=0
}
}
cout<<dp[la][lb]<<endl;
}
}