WOJ1047-LCS Problem
来源:互联网 发布:卫衣好看的淘宝店铺 编辑:程序博客网 时间:2024/06/05 12:20
Recently, Flymouse reads a book about Algorithm and Data Structure. The book reads: there are two types of LCS Problems. One is
Longest Common Subsequence problem. By the way of Dynamic Programming, we could solve this problem. The other is
Longest Common Substring problem, which is to find the longest string that is substrings of the two strings.
For example, given the following two strings:
1. flymouseEnglishpoor
2. comeonflymouseinenglish
The longest common substring is flymouse, the length of this string is 8.
输入格式
The first line contains a single integer t (1 <= t <= 100), the number of test cases.There will be two lines for each test case, each line
contains a string (The length of the two strings are no more than 2000 and you can assure all strings will not contains any punctuation
or other separators).
输出格式
For each test case, you should output one line containing the longest common substring?s length of the two strings of the test case.
样例输入
1flymouseEnglishpoorcomeonflymouseinenglish
样例输出
8
最长公共子串问题,暴力解决
#include<stdio.h>#include<string.h>char s1[2016],s2[2016];int len1,len2;int main(){int t,i,j,k,ans;scanf("%d",&t);while(t--){ans=0;scanf("%s %s",&s1,&s2);len1=strlen(s1);len2=strlen(s2);for(i=0;i<len1;i++){if(len1-i<=ans)break;for(j=0;j<len2;j++){if(s1[i]==s2[j]){k=1;while(s1[i+k]!='\0'&&s2[j+k]!='\0'&&s1[i+k]==s2[j+k])k++;if(ans<k)ans=k;}}}printf("%d\n",ans);}return 0;}
- WOJ1047-LCS Problem
- 自习算法:LCS Problem
- Problem F: LCS
- HDU Problem 1513 Palindrome 【LCS】
- WOJ 1047 LCS problem (LCS 算法总结 )
- HDU Problem 1159 Common Subsequence 【LCS】
- LCS
- LCS
- lcs
- LCS
- LCS
- LCS
- LCS
- LCS
- LCS
- LCS
- lcs
- LCS
- springMvc里的mvc:resources与静态资源的访问
- 编码集与乱码问题
- hbase-1.2.6完全分布式安装
- Java 8 中函数接口分析
- React Native集成到IOS应用
- WOJ1047-LCS Problem
- 位运算的实际应用
- MATLAB 将jpg图片合成avi视频
- grails设置web.xml
- Shiro(三) 会话管理
- 先码后看 java闭包 侵立删
- 非技术手段获取同学信息
- PHPExcel读取Excel文件出现内存不足
- 比特币协议杂谈(2)