UVA-10192-Vacation
来源:互联网 发布:营销软件 编辑:程序博客网 时间:2024/05/05 16:19
这个题同样是求LCS,我用的n^2的方法,
代码:
#include<cstdio>#include<cstring>#include<iostream>using namespace std;const int maxn=110;char stra[maxn],strb[maxn];int dp[maxn][maxn];int LCS(){ memset(dp,0,sizeof(dp)); int lena=strlen(stra); int lenb=strlen(strb); for(int i=0;i<lena;i++)for(int j=0;j<lenb;j++){ if(stra[i]==strb[j]) dp[i+1][j+1]=dp[i][j]+1; else dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);} return dp[lena][lenb];}int main(){ int cas=1; while(gets(stra)!=NULL) {if(stra[0]=='#') break;gets(strb);printf("Case #%d: you can visit at most %d cities.\n",cas++,LCS()); } return 0;}
- uva 10192 Vacation
- UVa 10192 - Vacation
- UVA 10192 Vacation
- UVA 10192 Vacation
- UVa 10192 - Vacation
- UVa 10192 - Vacation
- UVa 10192 - Vacation
- UVa 10192 - Vacation
- UVA-10192-Vacation
- UVa 10192: Vacation
- UVa:10192 Vacation
- UVA - 10192 Vacation
- UVa 10192 - Vacation
- UVA 10192 Vacation LCS
- uva 10192 Vacation
- UVa 10192—Vacation
- UVA - 10192Vacation(LIS)
- UVA 10192 - Vacation
- 用grep查找文件内容
- UVA-674-Coin Change
- Ambition
- 黑马程序员_领略Java内部类的“内部”
- 批处理文件编程
- UVA-10192-Vacation
- UVA-147-Dollars
- <重构>读书笔记之<提炼方法>
- 黑马程序员_Java编程基础(三)
- UVA-357-Let Me Count The Ways
- hdu 1067 Gap bfs+hash
- UVA-10285-Longest Run on a Snowboard
- UVA-825-Walking on the Safe Side
- 网络客户端(1)------连接