Educational Codeforces Round 9-B. 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.

题意：

输入n，n个价值，对应n个只有'A','B'两个字符的字符串。可以对前缀或后缀进行一次‘A'变成'B',或’B'变成‘A'.求出最大的’B'价值和。

AC代码：

#include<iostream>
#include<functional>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef unsigned __int64 LL;
typedef  __int64 ll;
#define CMP bool cmp(const node& a,const node& b){	return a.R<b.R||(a.R==b.R&&a.L<b.L); }
const int T = 503000;
const int mod = 1000000007;

ll v[T],sa[T],sb[T];
char s[T];

int main()
{
#ifdef zsc
    freopen("input.txt","r",stdin);
#endif

	int i,j,k;
	ll n,m;
	
	while(~scanf("%I64d",&n))
	{
		for(i=1;i<=n;++i){
			scanf("%I64d",&v[i]);
		}
		scanf("%s",s+1);
		fill(sa,sa+T,0);
		fill(sb,sb+T,0);
		for(i=1;i<=n;++i){
			sa[i] += sa[i-1];//A的前缀和
			sb[i] += sb[i-1];//B的前缀和
			if(s[i]=='A'){
				sa[i] += v[i];
			}
			else {
				sb[i] += v[i];
			}
		}
		ll sum = -1;
		for(i=1;i<=n;++i){
			sum = max(sum,sa[i]+sb[n]-sb[i]);//改变前缀
			sum = max(sum,sb[n-i+1]+sa[n]-sa[n-i+1]);//改变后缀
		}
		printf("%I64d\n",sum);
	}

    return 0;
}