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.
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).
Print the only integer a — the maximum strength Bob can achieve.
5 1 2 3 4 5 ABABA
11
5 1 2 3 4 5 AAAAA
15
1 1 B
1
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.
先将属于A和B的值分别加起来,然后对每一个字符维护一个他的前缀和以及后缀和,找出最大值。
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 500010
using namespace std;
long long int dp1[maxn],dp2[maxn];
struct node
{
long long int p;
char c;
}a[maxn];
int main()
{
int n;
memset(dp1,0,sizeof(dp1));
memset(dp2,0,sizeof(dp2));
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%lld",&a[i].p);
getchar();
for(int i=0;i<n;i++) scanf("%c",&a[i].c);
if(a[0].c=='A'){
dp1[0]=a[0].p;
}
else{
dp2[0]=a[0].p;
}
for(int i=1;i<n;i++){
dp1[i]=dp1[i-1];
dp2[i]=dp2[i-1];
if(a[i].c=='A')
dp1[i]+=a[i].p;
else
dp2[i]+=a[i].p;
}
long long int ans=0;
for(int i=0;i<n;i++){
ans=max(ans,dp2[n-1]-dp2[i]+dp1[i]);
ans=max(ans,dp2[i]+dp1[n-1]-dp1[i]);
}
printf("%lld\n",ans);
}