// yuki 935 うしたぷにきあくん笑ビ-ム // 2019.11.30 bal4u #include #include typedef long long ll; int getchar_unlocked(void); int putchar_unlocked(int c); #define gc() getchar_unlocked() #define pc(c) putchar_unlocked(c) int in() { // 非負整数の入力 int n = 0; int c; do c = gc(); while (isspace(c)); do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0'); return n; } void ins(char *s) { // 文字列の入力 スペース以下の文字で入力終了 do *s = gc(); while (*s++ > ' '); *(s-1) = 0; } void out(int n) { // 非負整数の表示(出力) int i; char b[30]; if (!n) pc('0'); else { i = 0; while (n) b[i++] = n % 10 + '0', n /= 10; while (i--) pc(b[i]); } pc('\n'); } int N; char S[2005]; ll s[2005]; int x[2005]; ll k[2005]; int ma; int bs(ll x) { int m, l = 0, r = ma+1; while (l < r) { m = (l+r) >> 1; if (k[m] <= x) l = m + 1; else r = m; } return l-1; } int main() { int i, j, t, Q; ll tt; N = in(); ins(S+1); for (i = 1; i <= N; ++i) { if (S[i] == 'E') x[i] = x[i-1] + 1; else x[i] = x[i-1]; s[i] = s[i-1] + in(); } ma = 0; for (i = 0; i < N; ++i) for (j = i+1; j <= N; ++j) { t = x[j]-x[i]; if (t == 0) continue; tt = s[j]-s[i]; if (k[t] == 0 || k[t] > tt) { k[t] = tt; if (t > ma) ma = t; } } Q = in(); while (Q--) out(bs((ll)in())); return 0; }