感觉自己今天犯二问题极为严重。。。大概是有些小感冒的缘故吧。
直接正题:
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.
给定序列的子序列是给定的序列,其中一些元素(可能没有)被省略。给定一个序列X=<x1,x2,…,xm>另一个序列Z=<z1,z2,…,Z k>是X的子序列,如果X的指数存在严格递增的序列<i1,i2,…,ik>,那么对于所有j=1,2,…,k,xij=zj。例如,Z=<a,b,f,c>是索引序列<1,2,4,6>的X=<a,b,c,f,b,c>的子序列。给定两个序列X和Y,问题是求X和Y的最大长度公共子序列的长度。 程序输入来自文本文件。文件中的每个数据集都包含两个表示给定序列的字符串。序列由任意数量的空格分隔。输入数据正确。对于每一组数据,程序在标准输出端打印从单独行开始的最大长度公共子序列的长度。
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
解析:dp,剩下的见代码好了。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char a[1005],b[1005];
int dp[1005][1005];
int main(){
while(cin>>a>>b){
int k,p;
k=strlen(a);
p=strlen(b);
for(int i = 1;i <= k;i++){
for(int j = 1;j <= p;j++){
if(b[j-1]==a[i-1]){
dp[i][j]=dp[i-1][j-1]+1;
}
else dp[i][j]=dp[i-1][j]>dp[i][j-1]?dp[i-1][j]:dp[i][j-1];
}
}
cout<<dp[k][p]<<endl;
}
}