mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
31 lines
746 B
C++
31 lines
746 B
C++
|
/// LCS 最长子序列
|
||
|
|
namespace LCS
|
||
|
|
{
|
||
|
|
const int MAXLEN_A = 500;
|
||
|
|
const int MAXLEN_B = 500;
|
||
|
|
int dp[MAXLEN_A+5][MAXLEN_B+5];
|
||
|
|
int deal(const char* a,const char* b)
|
||
|
|
{
|
||
|
|
int lena=strlen(a);
|
||
|
|
int lenb=strlen(b);
|
||
|
|
for(int i=0;i<lenb;i++)
|
||
|
|
{
|
||
|
|
for(int j=0;j<lena;j++)
|
||
|
|
{
|
||
|
|
if(i==0) dp[i][j]=0;
|
||
|
|
else if(b[i]==a[j])
|
||
|
|
{
|
||
|
|
if(j!=0) dp[i][j]=dp[i-1][j-1]+1;
|
||
|
|
else dp[i][j]=1;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
if(j!=0) dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
|
||
|
|
else dp[i][j]=dp[i-1][j];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return dp[lenb-1][lena-1];
|
||
|
|
}
|
||
|
|
}//End of namespace LCS
|