dp—动态规划
对各状态维度进行分阶段、有顺序、无重复、决策性的遍历求解。
例题:
Common Subsequence
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.
Input
abcfbc abfcab
programming contest
abcd mnp
output
4
2
0
题意:求最大子序列个数,用递归会超时,所以需要用递推。
ac代码:
#include <bits/stdc++.h>
using namespace std;
int T,n,m;
int a[1001][1001];
string s1,s2;
int main()
{
while(cin>>s1>>s2)
{
memset(a,0,sizeof a);
int len1=s1.size(),len2=s2.size();
for(int i=1;i<=len1;i++){
for(int j=1;j<=len2;j++)
{
if(s1[i-1]==s2[j-1]) a[i][j]=max(a[i][j],a[i-1][j-1]+1);
else a[i][j]=max(a[i][j-1],a[i-1][j]);
}
}
cout<<a[len1][len2]<<endl;
}
}