题目意思,有两个字符串,S,T,将S中的字符删除若干个,问在删除后,S中包含的T的字符串最多有多少个。DP即可。dp[i][j]表示S的字符字串为S[0,i),删除字符个数为j的时候,可以最多匹配的T的个数。这个时候有3个转移dp[i+1][j+1],dp[i+1][j],还有就是dp[i+A[i]]j+A[i]-lent]。这个表示的是从s[i]开始后面A[i]个字符包含T。那么就有dp[i + A[i]][j + A[i] - lent] = max(dp[i + A[i]][j + A[i] - lent], dp[i][j] + 1);
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <cassert>
#include <stack>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int>pll;
const int N = 2010;
const int oo = 1000000007;
void add(int &a, int b){
a += b;
while (a >= oo) a -= oo;
while (a < 0) a += oo;
}
char s[N], t[N];
int A[N];
int dp[N][N];
int main(){
gets(s);
gets(t);
int lens = strlen(s);
int lent = strlen(t);
for (int i = 0; i < lens; i++){
int start = i;
int begin = 0;
while (1){
if (t[begin] == s[start]){
begin++;
start++;
}
else start++;
if (begin == lent) break;
if (start == lens) break;
}
if (begin == lent) A[i] = start - i;
else A[i] = -1;
}
//A[i]表示[i,start) contains t, start = A[i]+i;
//对于下标还是有很多疑问。
//dp[i][j] 表示的是删除了j个字符,并且s的字串是【0 i)
for (int i = 0; i < lens; i++){
for (int j = 0; j <= i; j++){
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
dp[i + 1][j+1] = max(dp[i + 1][j+1], dp[i][j]);
if (A[i] >= 0){
dp[i + A[i]][j + A[i] - lent] = max(dp[i + A[i]][j + A[i] - lent], dp[i][j] + 1);
}
}
}
for (int i = 0; i <= lens; i++)
cout << dp[lens][i] << " ";
cout << endl;
}