（Educational Codeforces Round 9 ）Alice, Bob, Two Teams（前缀和）

（Educational Codeforces Round 9 ）Alice, Bob, Two Teams（前缀和）

Alice, Bob, Two Teams

time limit per test1.5 seconds memory limit per test256 megabytes inputstandard input outputstandard output

Alice and Bob are playing a game. The game involves splitting up game pieces into two teams. There are n pieces, and the i-th piece has a strength pi.

The way to split up game pieces is split into several steps:

First, Alice will split the pieces into two different groups A and B. This can be seen as writing the assignment of teams of a piece in an n character string, where each character is A or B.

Bob will then choose an arbitrary prefix or suffix of the string, and flip each character in that suffix (i.e. change A to B and B to A). He can do this step at most once. Alice will get all the pieces marked A and Bob will get all the pieces marked B. The strength of a player is then the sum of strengths of the pieces in the group.

Given Alice’s initial split into two teams, help Bob determine an optimal strategy. Return the maximum strength he can achieve.

Input

The first line contains integer n (1 ≤ n ≤ 5·105) — the number of game pieces.

The second line contains n integers pi (1 ≤ pi ≤ 109) — the strength of the i-th piece.

The third line contains n characters A or B — the assignment of teams after the first step (after Alice’s step).

Output

Print the only integer a — the maximum strength Bob can achieve.

Examples

input

5 1 2 3 4 5 ABABA

output

11

input

5 1 2 3 4 5 AAAAA

output

15

input

1 1 B

output

1

Note

In the first sample Bob should flip the suffix of length one.

In the second sample Bob should flip the prefix or the suffix (here it is the same) of length 5.

In the third sample Bob should do nothing.

题意

有n个物品，每个物品有一个分值 然后每个物品有一个标牌，如果标牌上是A，那么就属于A，是B，那么就属于B 现在你可以选择一个前缀或者后缀，然后将上面的A改成B，将B改成A 然后问你最多B能够得到多少

题解： 暴力维护前缀和

维护A的前缀和，和B的前缀和

翻转其实就是把A的变成B，B的变成A

#includeusing namespace std;const int maxn = 5e5+7;int n;long long p[maxn];char s[maxn];long long sum1[maxn];long long sum2[maxn];int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%lld",&p[i]); scanf("%s",s+1); for(int i=1;i<=n;i++) { sum1[i]=sum1[i-1]; sum2[i]=sum2[i-1]; if(s[i]=='A') sum1[i]+=p[i]; else sum2[i]+=p[i]; } long long ans = max(sum2[n],sum1[n]); for(int i=1;i<=n;i++) { ans = max(ans,sum2[n]-sum2[i]+sum1[i]); ans = max(ans,sum2[i]+sum1[n]-sum1[i]); } cout<

#include#include#includeusing namespace std;#define maxn 500010int a[maxn];char s[maxn],temp[maxn];int n;long long Max=-1000,sum=0;void init(){ cin>>n; for(int i=0;i>a[i]; } for(int i=0;i>s[i]; }}void work(){ for(int i=0;i=0;i--){ if(s[i]=='A'){ sum+=a[i]; if(sum>Max) Max=sum; } else{ sum-=a[i]; } } sum=temp; for(int i=0;iMax) Max=sum; } else{ sum-=a[i]; } }}int

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。