【2022年11月23日提高A组】匹配【DP】

思路：

直接设fi,j表示s匹配到i，t匹配到j

$code$

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

const int MAXN = 2e3 + 5;

int t, f[MAXN][MAXN], b[MAXN][26];
char s1[MAXN], s2[MAXN];

int main() {
	scanf("%d", &t);
	while(t --) {
		scanf("%s%s", s1 + 1, s2 + 1);
		int len1 = strlen(s1 + 1), len2 = strlen(s2 + 1);
		for(int i = 1; i <= len1; i ++) {
			for(int j = 0; j < 26; j ++)
				b[i][j] = 0, b[i][j] += b[i - 1][j] + (s1[i] - 'a' == j);
		}
		f[0][0] = 1;
		for(int i = 1; i <= len1; i ++)
			for(int j = 1; j <= len2; j ++) {
				f[i][j] = 0;
				if(s2[j] == s1[i] || s2[j] == '.') f[i][j] |= f[i - 1][j - 1];
				if(s2[j] == '*') {
					if(s1[i] == s1[i - 1]) f[i][j] |= f[i - 1][j];
					f[i][j] |= f[i][j - 1];
				}
			}
		int ans = 0;
		for(int i = 1; i <= len1; i ++)
			ans += f[i][len2];
		printf("%d\n", ans);
	}
	return 0;
}