uva 10405 Longest Common Subsequence(最长公共子序列)
来源:互联网 发布:java高并发项目实战 编辑:程序博客网 时间:2024/05/02 09:44
经典的最长公共子序列问题,我刚开始用string敲的,就是为了练练手,没想到竟然wa了,还以为我用错了呢。。。换了字符数还是wa。。。真无语,这么简单的题快把我弄糊涂了,后来听人说是输入可能有空格。。。这是巨坑啊,题上都没说清楚,白白wa了几发。。。就是设一个数组d[i][j]遍历两个字符数组当a[i]==b[j]的时候d[i][j]=d[i-1][j-1]+1。不相等的时候就是d[i][j]=max(d[i-1][j],d[i][j-1])。别忘了初始化。真坑
代码:
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<vector>#include<set>#include<string>#include<algorithm>using namespace std;int d[1005][1005];int main(){string a,b;int i,j;while(getline(cin,a),getline(cin,b)){//for(i=0; i<=max(a.size(),b.size()); i++)//d[0][i] = d[i][0] = 0;memset(d,0,sizeof(d));for(i=1; i<=a.size(); i++)for(j=1; j<=b.size(); j++){if(a[i-1] == b[j-1]){d[i][j] = d[i-1][j-1]+1;}else{d[i][j] = max(d[i-1][j],d[i][j-1]);}}cout << d[a.size()][b.size()] << endl;a.clear();b.clear();}return 0;}
0 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 最长公共子序列 LCS
- UVa 10405 - Longest Common Subsequence 最长公共子序列模板
- Longest Common Subsequence - UVa 10405 最长公共子序列(数据有坑)
- 最长公共子序列Longest Common Subsequence
- 最长公共子序列 (longest common subsequence)
- 最长公共子序列(Longest Common Subsequence)
- Longest Common Subsequence 最长公共子序列
- uvaoj 10405 Longest Common Subsequence 最长公共子序列
- 最长公共子序列(Longest Common Subsequence LCS)
- UVa10405 - Longest Common Subsequence ( 最长公共子序列 )
- 最长公共子序列(Longest-Common-Subsequence,LCS)
- uva10405 - Longest Common Subsequence(LCS,最长公共子序列)
- 最长公共子序列LCS(The longest common subsequence)
- 新手学习计算机必须知道
- Androd WebView中的图片浏览及缩放
- 计算机网络-Tcp的四次挥手
- Spring基于自定义注解的用户认证
- 检测和解决Android应用的性能问题
- uva 10405 Longest Common Subsequence(最长公共子序列)
- Dungeon Master
- 耐心排序
- UI04_UITouch(视图随手移动效果)
- JPA下利于快速开发、快速调整业务的程序结构设计
- 数据挖掘常用的的R包和函数的集合
- 控制台下改变背景或字体颜色
- leetcode 109 —— Convert Sorted List to Binary Search Tree
- POJ_3009 Curling 2.0(dfs)