Uva-111-History Grading
2013-07-02 01:31
471 查看
简单的DP,算最长公共子序列即可
代码:
代码:
#include<cstdio> #include<cstring> #include<iostream> using namespace std; const int maxn=30; int n,a[maxn],b[maxn],dp[maxn][maxn]; int DP() { for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { if(a[i]==b[j]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } return dp ; } int main() { int ita; scanf("%d",&n); scanf("%d",&ita); a[ita]=1; for(int i=2;i<=n;i++) { scanf("%d",&ita); a[ita]=i; } while(scanf("%d",&ita)!=EOF) { b[ita]=1; for(int i=2;i<=n;i++) { scanf("%d",&ita); b[ita]=i; } printf("%d\n",DP()); } return 0; }
相关文章推荐
- UVA 111 History Grading
- UVa 111 - History Grading 最长递增子序列 LIS
- 序列代码UVa 111 History Grading (最长公共子序列)
- uva 111 History Grading(DP初步应用)
- uva 111 History Grading(lcs)
- UVa 111 - History Grading (最长公共子序列)
- uva 111 History Grading
- uva 111 History Grading
- UVa 111 - History Grading
- UVa 111 - History Grading 最长递增子序列 LIS
- UVA - 111 - History Grading (LCS)
- UVa 111 History Grading (DP&LCS)
- [动态规划]UVA111 - History Grading
- History Grading(uva 111)
- uva 111 History Grading
- History Grading - UVa 111 最长公共子序列 注意序列输入
- [UVA 111] History Grading
- uva 111 - History Grading(LCS)
- uva 111 History Grading(动态规划:LCS)
- UVA 111 History Grading(最长公共子序列dp)