UVA 10066 - The Twin Towers
2015-03-16 14:02
162 查看
本题是双塔问题,主要考察了最长公共子序列的知识,是我做动规的第一题,动规题重在思路,而考虑的重点就是状态转移方程,本题所代表的一类题主要考虑的状态方程如下:
什么时候:f[i][j] = f[i-1][j-1] +1;
什么时候:f[i][j] = f[i-1][j];
什么时候:f[i][j] = f[i][j-1];
考虑好了这个,题目也就解出来了。。。。
代码如下:
#include<stdio.h> #include<string.h> #define MAXN 100 + 10 int a[MAXN], b[MAXN], f[MAXN][MAXN]; int N1, N2, max; void solve() { max = 0; memset(f, 0, sizeof(f)); for(int i = 1; i <= N1; i ++) for(int j = 1; j <= N2; j ++) { if(a[i] == b[j]) f[i][j] = f[i-1][j-1] + 1; else { if(f[i-1][j] >= f[i][j-1]) f[i][j] = f[i-1][j]; else f[i][j] = f[i][j-1]; } if(f[i][j] > max) max = f[i][j];//printf("i = %d j = %d f[i][j]=%d max = %d\n",i,j,f[i][j],max); } printf("Number of Tiles : %d\n\n",max); } void input() { int t = 0; while(scanf("%d%d",&N1,&N2) == 2) { if(N1 == 0&&N2==0) break; for(int i = 1; i <= N1; i ++) scanf("%d",&a[i]); for(int j = 1; j <= N2; j ++) scanf("%d",&b[j]); printf("Twin Towers #%d\n", ++ t); solve(); } } int main() { input(); return 0; }
相关文章推荐
- UVA 10066 - The Twin Towers
- uva 10066 - The Twin Towers
- UVa:10066 The Twin Towers
- UVA10066 - The Twin Towers
- UVa 10066 The Twin Towers (DP&LCS)
- uva 10066 The Twin Towers
- UVa 10066 - The Twin Towers
- UVa 10066 - The Twin Towers
- UVa 10066 - The Twin Towers
- UVa 10066 - The Twin Towers
- Uva-10066-The Twin Towers
- UVa 10066: The Twin Towers
- UVA 10066 - The Twin Towers
- UVA 10066 The Twin Towers
- UVa 10066 - The Twin Towers
- uva 10066 The Twin Towers
- UVA 10066 The Twin Towers
- UVA - 10066 The Twin Towers
- uva_10066 The Twin Towers
- UVa 10066 - The Twin Towers