cf 766#

天呢，太垃圾了我。。

AB懵逼了半天题意，C最后搞了个DP还不对。。。DP太垃圾了，，

#include<bits/stdc++.h>
#define INF 0x7fffffff
#define LL long long
#define N 100005
using namespace std;
inline int ra()
{
    int x=0,f=1; char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while (ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}
    return x*f;
}
int main()
{
    string s1,s2; cin>>s1>>s2;
    if (s1.length()!=s2.length())
    {
        if (s1.length()>s2.length())
            cout<<s1.length();
        else cout<<s2.length();
    }
    else 
    {
        if (s1==s2) cout<<"-1";
        else cout<<s1.length();
    }
    return 0;
}

#include<bits/stdc++.h>
#define INF 0x7fffffff
#define LL long long
#define N 100005
using namespace std;
inline int ra()
{
    int x=0,f=1; char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while (ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}
    return x*f;
}
int a[N];
int main()
{
    int n=ra();
    for (int i=1; i<=n; i++) a[i]=ra();
    sort(a+1,a+n+1);
    for (int i=1; i<=n-2; i++)
    {
        if (a[i]+a[i+1]>a[i+2] && a[i+1]-a[i]<a[i+2])
        {
            cout<<"YES";
            return 0;
        }
    }
    cout<<"NO";
    return 0;
}

/*#include<bits/stdc++.h>
#define INF 0x7fffffff
#define LL long long
#define N 100005
using namespace std;
inline LL ra()
{
    LL x=0,f=1; char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while (ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}
    return x*f;
}
bool vis[1005][1005];
LL n,f[1005][1005],a[50],anslen;
char s[1005];
const LL mod=1e9+7;
int main()
{
    n=ra(); scanf("%s",s+1);
    for (LL i=0; i<26; i++) a[i]=ra();
    LL mn=INF;
    for (LL i=1; i<=n; i++)
    {
        mn=min(mn,a[s[i]-'a']);
        if (mn<i) break;
        f[i][1]=1;
        vis[i][1]=1;
        anslen=max(anslen,i);
    }
    for (LL i=1; i<=n; i++)
    {
        for (LL j=2; j<=i; j++)
        {
            LL mn=a[s[i]-'a'],cnt=1;
            for (LL k=i-1; k>=1; k--,cnt++)
            {
                mn=min(mn,a[s[k]-'a']);
                if (mn<cnt) break;
                f[i][j]+=f[k][j-1];
                if (vis[k][j-1]) vis[i][j]=1;
                f[i][j]%=mod;
                if (vis[k][j-1]) anslen=max(anslen,cnt);
            }
        }
    }
    LL anstot=0,ansnum;
    for (LL i=1; i<=n; i++) anstot+=f[n][i],anstot%=mod;
    cout<<anstot<<endl;
    for (LL i=1; i<=n; i++) 
        if (f[n][i]) 
        {
            ansnum=i;
            break;
        }
    cout<<anslen<<endl<<ansnum;
    return 0;
}*/
#include<bits/stdc++.h>
#define INF 0x7fffffff
#define LL long long
#define N 100005
using namespace std;
inline LL ra()
{
    LL x=0,f=1; char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while (ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}
    return x*f;
}
int f[N],n,dp[N],a[N],mx;
char s[N];
const int mod=1e9+7;
bool check(int i, int j)
{
    int l=j-i+1;
    for (int k=i; k<=j; k++)
    {
        if (a[s[k]-'a']<l)
            return 0;
    }
    return 1;
}
int main()
{
    n=ra(); scanf("%s",s+1);
    for (int i=0; i<26; i++) a[i]=ra();
    memset(f,0x3f,sizeof(f));
    dp[0]=1; f[0]=0;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=i; j++)
            if (check(i-j+1,i))
            {
                dp[i]=(dp[i]+dp[i-j])%mod;
                f[i]=min(f[i],f[i-j]+1);
                if (dp[i-1]) mx=max(mx,j);
            }
    cout<<dp[n]<<endl;
    cout<<mx<<endl;
    cout<<f[n]<<endl;
}