poj 1458 common subsequence
来源:互联网 发布:视频翻译软件下载 编辑:程序博客网 时间:2024/05/16 17:02
题目链接:http://poj.org/problem?id=1458
题目要求就是求出两个字符串的最长公共子序列的长度
最长公共子序列问题详解:http://blog.csdn.net/yysdsyl/article/details/4226630
上代码:
#include<stdio.h>#include<string.h>char s1[500];char s2[500];int d[501][501];int main(){ int i,j; int n,m; while(scanf("%s %s",s1,s2) != EOF) { n = strlen(s1); m = strlen(s2); for(i = 1; i <= n; ++i) { for(j = 1; j <= m; ++j) { if(s1[i-1] == s2[j-1]) d[i][j] = d[i-1][j-1] + 1; else if(d[i][j-1] > d[i-1][j]) d[i][j] = d[i][j-1]; else d[i][j] = d[i-1][j]; } } printf("%d\n",d[n][m]); } return 0;}
0 0
- Common Subsequence--poj--1458
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- Poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ-1458-Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- Spring+Log4j+ActiveMQ实现远程记录日志
- 五种布局
- JMS activeMQ
- css3属性 滤镜详解
- MQ、JMS以及ActiveMQ
- poj 1458 common subsequence
- (GOF23设计模式)_简单工厂模式详解
- K-Means实现HelloWorld聚类代码
- 手机优化
- 网站的关键词库需要怎么去安排
- 欢迎使用CSDN-markdown编辑器
- java37.Socket通信------使用ServerSocket建立聊天服务器---1
- 小桀打毒图的时候来写道树形dp
- C++标准库中正则表达式简介