uva 10405 Longest Common Subsequence
来源:互联网 发布:ibm人工智能产品 编辑:程序博客网 时间:2024/06/09 16:47
题意:给你两个字符串,要你求出最长公共子串。
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int N=1000;char str1[N],str2[N];int map[N][N];int main(){ while(gets(str1)&&gets(str2)) { memset(map,0,sizeof(map)); int len1=strlen(str1),len2=strlen(str2); for(int i=0;i<len1;i++) { for(int j=0;j<len2;j++) { if(str1[i]==str2[j]) { 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("%d\n",map[len1][len2]); } 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
- 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
- UVa 10405 - Longest Common Subsequence
- UVA-10405-Longest Common Subsequence
- UVa 10405: Longest Common Subsequence
- UVA 10405 - Longest Common Subsequence
- 重载OnOK、OnCancle、OnClose
- Ipod 还原出厂设置
- mysql 循环语句
- 要养成良好的书写Sql的习惯
- 什么是缓存
- uva 10405 Longest Common Subsequence
- 产业链金字塔顶端:TD终端芯片“众生相”
- 使用firefox的firebug插件进行网页js调试----firebug使用
- 网站编码问题
- RSA与大数运算(C语言)
- ARM-Linux驱动--RTC(实时时钟)驱动分析 .
- 职场中不可深交的五种人
- Oracle学习的经验谈
- 在Oracle中进行大小写不敏感的查询