codeforces 808G Anthem of Berland（KMP+DP）

codeforces 808G Anthem of Berland（KMP+DP)

①三个转移（见代码）
②注意j逆序枚举

#include<bits/stdc++.h>
#define N 100010
using namespace std;
char a[N], b[N]; 
int nxt[N];
vector < int > f[N];

inline int Match(int i, int j)
{
	return a[i] == '?' || a[i] == b[j];
}

inline void Relax(int &x, int y)
{
	x = max(x, y);
}

int main()
{
	scanf("%s%s", a + 1, b + 1);
	int n = strlen(a + 1), m = strlen(b + 1);
	
	for(int i=2; i<=m; ++i)
	{
		int j = nxt[i-1];
		while(j && b[i] != b[j+1]) j = nxt[j];
		nxt[i] = j + (b[i] == b[j+1]);
	}
	
	for(int i=0; i<=n; ++i)
		f[i].resize(m + 1);
	
	for(int i=0; i<=n; ++i)
	for(int j=0; j<=m; ++j)
		f[i][j] = -0x3f3f3f3f;
	
	f[0][0] = 0;
	for(int i=0; i<=n; ++i)
	for(int j=m; j>=0; --j)
	{
		if(i < n)
			Relax(f[i+1][0], f[i][j]);
		Relax(f[i][nxt[j]], f[i][j] + (j == m));
		if(i < n && Match(i + 1, j + 1))
			Relax(f[i + 1][j + 1], f[i][j]);
	}
	
	int ans = 0;
	for(int i=0; i<=m; ++i)
		ans = max(ans, f[n][i]);
	cout << ans;
}