题解

#include<bits/stdc++.h>
using namespace std;
int a[100005];
long long dp[100005];
int main(){
    int n;
    string s;
    cin >> n >> s;
    s = " " + s;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }
    dp[0] = 0;
    for(int i = 1;i <= n;i++){
        bool vis[27] = {0};
        for(int len = 1;len <= 26 && i - len + 1 >= 1;len++){
            int c = s[i - len + 1] - 'a';
            if(vis[c]){
                break;
            }
            vis[c] = 1;
            dp[i] = max(dp[i],dp[i - len] + a[len]);
        }
    }
    cout << dp[n];
    return 0;
}