uva 10066 The Twin Towers
2011-10-20 15:39
393 查看
题意:最长公共子序列。
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int N=105; int main() { int n,m,t_cnt=0,a ,b ,map ; while(scanf("%d%d",&n,&m)!=EOF) { if(n==0&&m==0) break; memset(map,0,sizeof(map)); for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=0;i<m;i++) scanf("%d",&b[i]); for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(a[i]==b[j]) map[i+1][j+1]=max(map[i+1][j+1],map[i][j]+1); else map[i+1][j+1]=max(map[i][j+1],map[i+1][j]); } } printf("Twin Towers #%d\nNumber of Tiles : %d\n\n",++t_cnt,map [m]); } }
相关文章推荐
- 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
- 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