2016SDAU编程练习三1002
来源:互联网 发布:移动是什么网络模式 编辑:程序博客网 时间:2024/05/21 17:28
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. <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
题意:求两个串公共子序列长度
思路:套模板就行
感想:基础题老师讲了不少
AC代码:
#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;
}
}
- 2016SDAU编程练习三1002
- 2016SDAU编程练习三1001
- 2016SDAU编程练习三1006
- 2016SDAU编程练习三1010
- 2016SDAU编程练习三1011
- 2016SDAU编程练习三1012
- 2016SDAU编程练习三1013
- 2016SDAU编程练习三1014
- 2016SDAU编程练习三1015
- 2016SDAU编程练习三1016
- 2016SDAU编程练习三1017
- 2016SDAU编程练习三1018
- 2016SDAU编程练习三1023
- 2016SDAU编程练习三1004
- 2016SDAU编程练习三1007
- 2016SDAU课程练习三1002
- 2016SDAU课程练习三1002
- 2016sdau课程练习专题三 1002
- 微信公众号第三方平台开发PYTHON教程 PART 8
- TotalCommander究竟牛逼在哪里
- Windows 回调监控
- 二维数组中的查找3
- Linux 查找文件内容常用命令
- 2016SDAU编程练习三1002
- jquery实现日期的比较
- 内核input子系统
- x86虚拟地址到物理地址的映射学习
- 微信公众号第三方平台开发PYTHON教程 PART 9
- 网络信息安全实验室 补充基础关
- 所有接口添加plist文件的写法 swift
- laravel5.1框架下从数据库中获取数据的两种方式
- 大话Java事件监听模型