0分求条

//样例全对啊，为啥
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
ll a[N], n, dp[N];
string s;

int dfs(int len) {
    if (dp[len] != -1) {
        return dp[len];
    }
    if (len == 0) {
        return 0;
    }
    ll maxx = 0;
    unordered_set<char> st;
    for (int j = len - 1; j >= 0; j --) {
        if (st.find(s[j]) != st.end()) {
            break;
        }
        st.insert(s[j]);
        maxx = max(maxx, a[len - j] + dfs(j));
    }
    dp[len] = maxx;
    return dp[len];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> n;
    cin >> s;
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
    }
    memset(dp, -1, sizeof(dp));
    cout << dfs(n);
    return 0;
}