acm 3 1002 子序列
来源:互联网 发布:搞笑图片知乎 编辑:程序博客网 时间:2024/04/29 03:38
1.1002
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. <br>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. <br>
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
3.典型的动态规划问题
4.求最长公共子序列
5.
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[1005][1005];
int main()
{
int n,i,j;
string s1,s2;
char arr[1005];
while(~scanf("%s",arr))
{
s1=arr;
scanf("%s",arr);
s2=arr;
memset(dp,0,sizeof(dp));
for(i=0;i<s1.length();i++)
{
for(j=0;j<s2.length();j++)
{
if(s1[i]==s2[j])
{
dp[i+1][j+1]=dp[i][j]+1;
}
else
{
dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
}
}
}
cout<<dp[s1.length()][s2.length()]<<endl;
}
}
- acm 3 1002 子序列
- ACM-最大子序列和
- ACM-最长公共子序列
- 【ACM】最长公共子序列
- acm 最长上升子序列
- HDU ACM 3 1231 最大连续子序列
- sdut acm 最长上升子序列
- 最大连续子序列 hdu acm
- [acm]动态规划-最大连续子序列
- 南阳理工ACM 公共子序列
- HDU ACM 1024(最大子序列和)
- HDU ACM 1231 最大连续子序列
- acm练手 单调递增最长子序列
- ACM-动态规划4-公共子序列
- ACM DP 最长公共子序列Lcs
- ACM题:单调递增最长子序列
- ACM总结——最长公共子序列 & 最长不减(不增)子序列
- ACM总结——最长公共子序列 & 最长不减(不增)子序列
- Java 自定义异常
- 纯C语言矩阵乘法的Strassen算法,包含非2次幂的情况
- 设置Tomcat的UTF-8编码
- EditText 焦点控制,进入界面时不弹出键盘
- java异常
- acm 3 1002 子序列
- 笔记6:python参数
- 将string转换成char* (转)
- TP构造函数
- leetcode Intersection of Two Arrays
- TP更新操作判断
- 常量指针和指针常量的区别详解
- ACM 搜索 HDU 2553 N皇后问题
- MariaDB忘记root密码