样例都过了，但是全WA（讲懂可关）

#include <iostream>
#define N 100010
using namespace std;
char c[N];
int dp[50];
int a[N];
bool dic[50];
int main() {
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> c[i];
    }
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= n; i++){
        for(int j = i; j <= 26; j++){
            dp[j] = max(dp[j], dp[j - i] + a[i]);
        }
    }
    int i = 1;
    long long total = 0;
    while(i <= n){
        memset(dic, false, sizeof(dic));
        int count = 0;
        int k = i;
        while(k <= n && !dic[int(c[k] - 'a')]){
            dic[int(c[k] - 'a')] = true;
            count++;
            k++;
        }
        i = k;
        total += dp[count];
    }
    cout << total << endl;
    return 0;
}