Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Last version of LCS Template is wrong. Now it's right.

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-08-19 09:44:07 +08:00 committed by GitHub
parent 6399136b4e
commit 38c3397b63
1 changed files with 29 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

59
.ACM-Templates/LCS.cpp
View File

@ -1,30 +1,29 @@
/// 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
/// LCS 最长子序列
namespace LCS
{
const int MAXLEN_A = 512;
const int MAXLEN_B = 512;
int dp[MAXLEN_A][MAXLEN_B];
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(j==0) dp[i][j]=0;
else if(b[i-1]==a[j-1])
{
dp[i][j]=dp[i-1][j-1]+1;
}
else
{
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
}
return dp[lenb][lena];
}
}//End of namespace LCS