Codeforces Round #396 (Div. 2) C. Mahmoud and a Message-CSDN博客

本文链接：https://blog.csdn.net/WeYoungg/article/details/56017944

Mahmoud wrote a message s of length n. He wants to send it as a birthday present to his friend Moaz who likes strings. He wrote it on a magical paper but he was surprised because some characters disappeared while writing the string. That's because this magical paper doesn't allow character number i in the English alphabet to be written on it in a string of length more than ai. For example, if a1 = 2 he can't write character 'a' on this paper in a string of length 3 or more. String "aa" is allowed while string "aaa" is not.

Mahmoud decided to split the message into some non-empty substrings so that he can write every substring on an independent magical paper and fulfill the condition. The sum of their lengths should be n and they shouldn't overlap. For example, if a1 = 2 and he wants to send string "aaa", he can split it into "a" and "aa" and use 2 magical papers, or into "a", "a" and "a" and use 3 magical papers. He can't split it into "aa" and "aa" because the sum of their lengths is greater than n. He can split the message into single string if it fulfills the conditions.

A substring of string s is a string that consists of some consecutive characters from string s, strings "ab", "abc" and "b" are substrings of string "abc", while strings "acb" and "ac" are not. Any string is a substring of itself.

While Mahmoud was thinking of how to split the message, Ehab told him that there are many ways to split it. After that Mahmoud asked you three questions:

How many ways are there to split the string into substrings such that every substring fulfills the condition of the magical paper, the sum of their lengths is n and they don't overlap? Compute the answer modulo 109 + 7.
What is the maximum length of a substring that can appear in some valid splitting?
What is the minimum number of substrings the message can be spit in?

Two ways are considered different, if the sets of split positions differ. For example, splitting "aa|a" and "a|aa" are considered different splittings of message "aaa".

Input

The first line contains an integer n (1 ≤ n ≤ 103) denoting the length of the message.

The second line contains the message s of length n that consists of lowercase English letters.

The third line contains 26 integers a1, a2, ..., a26 (1 ≤ ax ≤ 103) — the maximum lengths of substring each letter can appear in.

Output

Print three lines.

In the first line print the number of ways to split the message into substrings and fulfill the conditions mentioned in the problem modulo 109 + 7.

In the second line print the length of the longest substring over all the ways.

In the third line print the minimum number of substrings over all the ways.

   Examples 
 

     input 
   
3
aab
2 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

     output 
   
3
2
2

     input 
   
10
abcdeabcde
5 5 5 5 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

     output 
   
401
4
3

题意是给一个由小写英文字母组成的长度为n的字符串s，每个小写字母x有对应的一个值a[x]，当一个字符串的长度超过a[x]时，则在这个串中不允许出现这个字母x，现在要把这个字符串进行划分，分割成多个子串，使得每个子串都是合法的（即长度≤子串中每个字母对应的a值）

输出三个答案：1，有多少种划分方案，对1e9+7取模，2，所有划分方法中使得某一串子串长度最长，输出这个子串的长度，3，所有划分方法中，使得划分成的子串的数量最少，输出这个数量。

1，设dp[i][j]为以i结尾，起点是j的划分方案个数，如果可行，满足i - j + 1<= minx(j,i) （这里minx【j】【i】代表从j到i的a【x】最小值，可以预处理一下），那么dp[i][j] += ∑（dp[j - 1] [k]）(1 <= k <= j-1) ，最后∑dp[n][j]就是划分方案的个数

2，求最长长度的话如果某个方案可行，我们维护一些i - j + 1的最大值即可

3，设maxn[i]为以i结尾的最少子串数量，如果某个方案可行 maxn[i] = min( maxn[j - 1] + 1 , maxn[i])；

#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<time.h>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<iostream>
using namespace std;
#define  LONG long long
const int   INF=0x3f3f3f3f;
const int MOD=1e9+7;
const double PI=acos(-1.0);
#define clrI(x) memset(x,-1,sizeof(x))
#define clr0(x) memset(x,0,sizeof x)
#define clr1(x) memset(x,INF,sizeof x)
#define clr2(x) memset(x,-INF,sizeof x)
#define EPS 1e-10
int a[30];
char str[10000];
int minx[1050][1050];
int dp[1050][1050];
int maxn[1050];
int sum[1050];
int main()
{
    int n ;
    cin>>n;
    scanf("%s",str+1);
    for(int i = 0; i < 26 ;++ i)
        scanf("%d",&a[i]);
    for(int i = 1; i<= n ;++ i)
    {
        minx[i][i] = a[str[i]-'a'] ;
        for(int j = i + 1; j<= n ;++ j)
            minx[i][j] = min(minx[i][j-1] , a[str[j]- 'a']) ;
    }
    clr1(maxn);
    clr0(dp);
    clr0(sum);
    dp[1][1] = 1;
    sum[1] = 1;
    sum[0] = 1;
    maxn[0] = 0;
    maxn[1] = 1;
    int ans2 = 1;
    for(int i = 2 ; i<=n ;++ i)
    {
        for(int j = 1; j <= i ;++ j)
            if(i - j + 1 <= minx[j][i])
            {
                maxn[i ] = min(maxn[j - 1] + 1, maxn[i]);
                dp[i][j] += sum[j-1];
                dp[i][j] %= MOD;
                ans2 = max(ans2 , i - j + 1);
            }
        for(int j = 1; j <= i ;++ j)
        {
            sum[i] +=dp[i][j];
            sum[i] %= MOD;
        }

    }
    cout<<sum[n]<<endl;
    cout<<ans2<<endl;
    cout<<maxn[n]  <<endl;
}