zoj 1733
2011-07-09 15:20
190 查看
#include<iostream>
#include<fstream>
#include<cstring>
using namespace std;
char c1[1001],c2[1001];
int dp[1011][1011];
void read(){
// ifstream cin("in.txt");
int i,j,k;
int n1,n2;
while(cin>>c1>>c2)
{
n1=strlen(c1);
n2=strlen(c2);
for(i=1;i<=n1;i++)
for(j=1;j<=n2;j++)
{
if(c1[i-1]==c2[j-1])
dp[i][j]=dp[i-1][j-1]+1;
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
cout<<dp[n1][n2]<<endl;
}
}
int main(){
read();
return 0;
}
#include<fstream>
#include<cstring>
using namespace std;
char c1[1001],c2[1001];
int dp[1011][1011];
void read(){
// ifstream cin("in.txt");
int i,j,k;
int n1,n2;
while(cin>>c1>>c2)
{
n1=strlen(c1);
n2=strlen(c2);
for(i=1;i<=n1;i++)
for(j=1;j<=n2;j++)
{
if(c1[i-1]==c2[j-1])
dp[i][j]=dp[i-1][j-1]+1;
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
cout<<dp[n1][n2]<<endl;
}
}
int main(){
read();
return 0;
}
相关文章推荐
- zoj 1733(LCS
- 1458 poj--zoj 1733---------------动态规划DP
- zoj 1733(LCS
- zoj 1733 Common Subsequence dp
- zoj 1733 || hdu 1159 Common Subsequence(Easy , classics DP)
- zoj 1733 Common Subsequence
- ZOJ 1733(Common Subsequence)
- ZOJ 1733 Common Subsequence(LCS)
- zoj 1733(LCS
- zoj 1733(LCS
- ZOJ 1009, 1115, 1476, 1733, 2405 解题报告
- zoj 1733(LCS
- zoj 1733(LCS
- ZOJ 1733 最长公共子串
- ZOJ - 1733 Common Subsequence
- zoj 1733(LCS
- zoj 1733【最长公共子序列DP】
- zoj 1733 Common Subsequence
- zoj 1733(LCS
- zoj上1733是求最长公共自序列吗?