【Codeforces】 477C Dreamoon and Strings

dp[i][j] 记录经过i个字符删掉j个字符达到的最大值。。然后匹配p串的单独处理，其他的考虑取和不取即可。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 2005
#define maxm 400005
#define eps 1e-10
#define mod 1000000007
#define INF 1e17
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int dp[maxn][maxn];
char s[maxn], p[maxn];

void init(void)
{
	memset(dp, 0, sizeof dp);
}

void read(void)
{
	scanf("%s", s+1);
	scanf("%s", p+1);
}

void debug(int n)
{
	for(int i = 1; i <= n; i++) {
		for(int j = 0; j <= n; j++)
			printf("%d ", dp[i][j]);
		printf("\n");
	}
}

void work(void)
{
	int n = strlen(s+1);
	int m = strlen(p+1);
	int t, k;
	for(int i = 1; i <= n; i++) {
		for(t = i, k = m; t && k; t--) if(s[t] == p[k]) k--;
		if(!k) for(int j = 0; j <= i - m; j++) if(i - t - m <= j) dp[i][j] = dp[t][j - i + t + m] + 1;
		for(int j = 0; j <= i; j++) {
			if(j) dp[i][j] = max(dp[i][j], dp[i-1][j-1]);
			dp[i][j] = max(dp[i][j], dp[i-1][j]);
		}
	}
	//debug(n);
	for(int i = 0; i <= n; i++) printf("%d%c", dp[n][i], i == n ? '\n' : ' ');
}

int main(void)
{
	init();
	read();
	work();

	return 0;
}