思路:这道题出得不错,dp里带点暴力,因为数据挺小的,首先用dp[i]表示在第i位切割有多少种方案,枚举每一位i,再枚举长度j,暴力判断在第i位切割该长度的字符串是否满足条件,若满足则dp[i]+=dp[i-j],其他的最小最大值以此类推。。。最后的答案相当于在最后一个字母后面切割,下面给代码:
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 1005
#define inf 0x3f3f3f3f
typedef long long LL;
const int mod = 1e9 + 7;
int a[30], dp[maxn], minnum[maxn];
char s[maxn];
bool jud(int x, int y){
for (int i = x - y + 1; i <= x; i++){
if (a[s[i] - 'a'] < y)
return false;
}
return true;
}
int main(){
int n;
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 0; i < 26; i++){
scanf("%d", &a[i]);
}
int maxnum = 0;
dp[0] = 1;
minnum[0] = 0;
for (int i = 1; i <= n; i++){
minnum[i] = inf;
for (int j = 1; j <= i; j++){
if (jud(i,j)){
dp[i] += dp[i - j];
dp[i] %= mod;
minnum[i] = min(minnum[i], minnum[i - j] + 1);
maxnum = max(maxnum, j);
}
}
}
printf("%d\n%d\n%d\n", dp[n], maxnum, minnum[n]);
}