Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 48592 Accepted Submission(s): 22343
Problem Description
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
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.
Sample Input
abcfbc abfcab
programming
contest abcd mnp
Sample Output
4 2 0
Source
LCS模板题。刚开始令maxn=1e4,爆内存,时间上优化需要用到后缀数组(表示还没学……),空间上优化可采纳滚动数组的用法
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e3;//maxn=1e4会内存超限
char a[maxn],b[maxn];
int dp[maxn][maxn];
int main()
{
while(scanf("%s%s",a,b)==2)
{
memset(dp,0,sizeof(dp));
int lena=strlen(a),lenb=strlen(b);
for(int i=1;i<=lena;i++)
{
for(int j=1;j<=lenb;j++)
{
if(a[i-1]==b[j-1]) dp[i][j]=dp[i-1][j-1]+1;
else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
printf("%d\n",dp[lena][lenb]);
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4;
char a[maxn],b[maxn];
int dp[2][maxn];
int main()
{
while(scanf("%s%s",a,b)==2)
{
memset(dp,0,sizeof(dp));
int lena=strlen(a),lenb=strlen(b);
int flag=1;
for(int i=1;i<=lena;i++)
{
for(int j=1;j<=lenb;j++)
{
if(a[i-1]==b[j-1]) dp[flag][j]=dp[!flag][j-1]+1;
else dp[flag][j]=max(dp[!flag][j],dp[flag][j-1]);
}
flag=!flag;
}
printf("%d\n",dp[!flag][lenb]);
}
return 0;
}