UVA 10405 Longest Common Subsequence
2011-08-23 12:18
549 查看
经典的DP,
本来可以开一个二维大数组的。
但是由于以前做过,现在再来做。。。
直接滚动数组水之(原谅我的无耻、、、)
还要注意,用scanf会Wa
本来可以开一个二维大数组的。
但是由于以前做过,现在再来做。。。
直接滚动数组水之(原谅我的无耻、、、)
还要注意,用scanf会Wa
#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> using namespace std; #define M 1003 char s[M],t[M]; int main(){ while(gets(s+1)){ gets(t+1); int dp[2][M]={0},len1=strlen(s+1),len2=strlen(t+1); int p,i,j; for(i=1;i<=len1;i++){ p=i&1; for(j=1;j<=len2;j++){ if(s[i]==t[j]) dp[p][j]=dp[!p][j-1]+1; else dp[p][j]=dp[p][j-1]>dp[!p][j]?dp[p][j-1]:dp[!p][j]; } } cout<<dp[len1&1][len2]<<endl; } return 0; }
相关文章推荐
- uva 10405 Longest Common Subsequence(最长公共子序列)
- UVA 10405 - Longest Common Subsequence(最长公共子序)
- uva 10405 - Longest Common Subsequence(最长公共子序列)
- UVA 10405 - Longest Common Subsequence
- UVA 10405 - Longest Common Subsequence
- UVA 10405 Longest Common Subsequence
- UVA 10405 Longest Common Subsequence (动态规划 LCS)
- UVA - 10405 Longest Common Subsequence(动态规划:LCS)
- Uva10405 Longest Common Subsequence
- UVA 10405 Longest Common Subsequence --经典DP
- UVa 10405 - Longest Common Subsequence
- UVA 10405 Longest Common Subsequence
- uva10405 - Longest Common Subsequence(LCS,最长公共子序列)
- uva 10405 - Longest Common Subsequence(注意空格陷阱)
- uva 10405 Longest Common Subsequence
- Uva 10405-Longest Common Subsequence(DP)
- UVa 10405 - Longest Common Subsequence
- 数组字符串uva 10405 - Longest Common Subsequence(最长公共子序列)
- uva 10405 Longest Common Subsequence
- UVA 10405 - Longest Common Subsequence