acm之动态规划题目6
来源:互联网 发布:js鼠标点击事件次数 编辑:程序博客网 时间:2024/06/05 03:29
Problem Description
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <
x1, x2, …, xm> another sequence Z = <
z1, z2, …, zk> is a subsequence of X if there exists a strictly increasing sequence <
i1, i2, …, ik> of indices of X such that for all j = 1,2,…,k, xij = zj. For example, Z = <
a, b, f, c> is a subsequence of X = <
a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
代码:
#include<stdio.h>#include<string.h>int max(int a,int b){ return a>b?a:b;}int main(){ char s1[700]; char s2[700]; int f[700][700]={ 0 }; while(scanf("%s%s",s1,s2)!=EOF){ int m=strlen(s1); int n=strlen(s2); for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ if(s1[i]==s2[j]){ f[i+1][j+1]=f[i][j]+1; }else{ f[i+1][j+1]=max(f[i][j+1],f[i+1][j]); } } } int max=0; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ if(f[i+1][j+1]>max){ max=f[i+1][j+1]; } } } printf("%d\n",max); } return 0;}
- acm之动态规划题目6
- acm之动态规划题目1
- acm之动态规划题目2
- acm之动态规划题目3
- acm之动态规划题目4
- acm之动态规划题目5
- acm之动态规划题目7
- [acm] 动态规划相关的题目 [ 个人 ]
- 动态规划思想:一道ACM题目
- 学习ACM之动态规划
- 学习ACM之动态规划
- 学习ACM之动态规划
- ACM-动态规划6-登山
- Pku acm 2250 Compromise 动态规划题目解题报告(六)
- Pku acm 1159 Palindrome 动态规划题目解题报告(七)
- Pku acm 2192 Zipper 动态规划题目解题报告(九)
- Pku acm 3356 AGTC 动态规划题目解题报告(十)
- Pku acm 1088 滑雪 动态规划题目解题报告(十五)
- category使用 objc_setAssociatedObject/objc_getAssociatedObject 实现添加属性
- 深度学习tracking学习笔记(2):图像/视觉显著性检测技术发展情况梳理(Saliency Detection、Visual Attention)
- 图片在固定大小容器中等比居中显示
- Spring 装配Bean的构造注入
- 学习笔记:jdbc连接、操作数据库SQL Server 2008
- acm之动态规划题目6
- Kafka监控——获取Partition的LogSize、Lag、BrokerId
- 完美横线标题全代码实现
- .net框架的程序集(元数据)
- ButterKnife 8.0.1
- Spring通过构造方法注入的四种方式 .
- windows 2012 R2 计划任务添加
- FlywayException:Validate failed:Migration checksum mismatch
- cuda-convnet2与caffe对比