Codeforces 632B：Alice, Bob, Two Teams（英文题。。。）

B. Alice, Bob, Two Teams

time limit per test

1.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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:

1. 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.
2. 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.
3. 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.

题目大意：读不懂题目啥意思。问你从前选一个子串，翻转A、B，计算B的总价值，从后选一个字串，翻转A、B，计算B的价值，求出最大的B的价值。

解题思路：先计算出所给串的B的总价值，然后从前开始依次翻转，遇到A，翻转后变成B，要加上他的价值，遇到B，翻转后变成A,要减去他的价值，每次翻转后更新下ans，然后倒着在来一遍，更新ans。

代码如下：

#include <cstdio>
#include <algorithm>
using namespace std;
__int64 p[500010];
char s[500010];
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%I64d",&p[i]);
	}
	__int64 maxx=0;
	__int64 ans=0;
	__int64 tmp=0;
	scanf("%s",s);
	for(int i=0;i<n;i++)//计算B的总价值 
	{
		if(s[i]=='B')
		{
			ans=ans+p[i];
		}
	}
	tmp=ans;
	__int64 o=ans;
	for(int i=0;i<n;i++)//从前开始翻转 
	{
		if(s[i]=='B')
		{
			tmp=tmp-p[i];
		}
		else
		{
			tmp=tmp+p[i];
		}
		ans=max(tmp,ans);//每翻转一个单位，更新下ans 
	}
	tmp=o;//ans变了，所以之前要用o存下它 
	for(int i=n-1;i>=0;i--)//从后开始翻转 
	{
		if(s[i]=='B')
		{
			tmp=tmp-p[i];
		}
		else
		{
			tmp=tmp+p[i];
		}
		ans=max(tmp,ans);//每翻转一个单位，更新下ans 
	}
	printf("%I64d\n",ans);
	return 0;
}