1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

const int maxn = 1000100;
const int M = 1<<22;
const long long inf = 1000000000100000000LL;

// drzewo
int q;
int T[2*M];
int Tt[2*maxn];

// podzial na ciagi
int curtabnr;
int tabnr[maxn], tabpos[maxn], tablen[maxn], start[maxn];

bool vis[maxn];

// dane
int n,m;
int a[maxn];
char s[maxn];

// robi drzewo
void init() {
	T[M] = 0;
	FORI(i,2*m) T[i+M] = T[i+M-1] + Tt[i-1];
	REPD(i,M-1,1) T[i] = min(T[2*i], T[2*i+1]);
}

int firstseg(int pos, int value) {
	while (pos < M) {
		if (T[pos*2] <= value) pos = pos*2;
		else pos = pos*2+1;
	}
	return pos-M;
}

int firstpos(int left, int right, int value) {
	left += M;
	right += M;
	value += T[left];
	if (T[left] <= value) return left-M;
	int res = right-M;
	while (left+1 < right) {
		if (!(left&1)) {
			if (T[left+1] <= value) return firstseg(left+1, value);
		}
		if (right&1) {
			if (T[right-1] <= value) res = min(res, firstseg(right-1, value));
		}
		left >>= 1;
		right >>= 1;
	}
	return res;
}

int getmin(int left, int right) {
	left += M;
	right += M;
	int temp = T[left];
	int res = min(T[left], T[right]);
	while (left+1 < right) {
		if (!(left&1)) res = min(res, T[left+1]);
		if (right&1) res = min(res, T[right-1]);
		left >>= 1;
		right >>= 1;
	}
	return res-temp;
}

long long getturns(int startpos, int money) {
	int nr = tabnr[startpos];
	int len = tablen[nr];
	int treepos = start[nr] + tabpos[startpos];
	int segsum = T[treepos+len+M]-T[treepos+M];
	int minsum = getmin(treepos, treepos+len);
	//printf("mam %d pieniedzy, trace max %d, okrazenie daje %d\n", money, minsum, segsum);
	if (money + minsum <= 0) return firstpos(treepos, treepos+len, -money)-treepos;
	if (segsum >= 0) return inf;
	int k = (minsum+money-segsum-1)/(-segsum);
	money += k * segsum;
	if (money + minsum > 0) printf("COS JEST ZLE!!!! money = %d, minsum = %d, segsum = %d, k = %d\n", money, minsum, segsum, k);
	return 1LL*k*len+firstpos(treepos, treepos+len, -money)-treepos;
}

int main () {
	scanf("%d", &n);
	FOR(i,n) scanf("%d", &a[i]);
	scanf("%d", &m);
	scanf("%s", s);
	/*
	n = 999763;
	m = 999683;
	srand(0);
	FOR(i,n) a[i]=rand()%1000000+1;
	FOR(i,m) s[i]=rand()%2 ? 'W' : 'P';
	printf("%d %d\n", a[0], a[50]);
	*/

	FOR(i,m) if (!vis[i]) {
		int pos = i;
		int curtabpos = 0;
		start[curtabnr] = q;
		while (!vis[pos]) {
			vis[pos] = true;
			tabnr[pos] = curtabnr;
			tabpos[pos] = curtabpos;
			Tt[q] = s[pos] == 'W' ? 1 : -1;
			q++;
			curtabpos++;
			pos = (pos+n)%m;
		}
		tablen[curtabnr] = curtabpos;
		FOR(j,curtabpos) {
			Tt[q] = Tt[q-curtabpos];
			q++;
		}
		curtabnr++;
	}

	init();
	/*
	printf("q=%d\n", q);
	FOR(i,q) printf("%d ", Tt[i]); printf("\n");
	FOR(i,q) printf("%d ", T[i+M]); printf("\n");*/

	long long bestturns = inf;
	int bestwho = -1;
	FOR(i,n) {
		int pos = i%m;
		long long turns = getturns(pos, a[i]);
		//printf("chlopiec %d zbankrutuje po %lld turach\n", i, turns);
		if (turns < bestturns) {
			bestturns = turns;
			bestwho = i;
		}
	}
	if (bestturns == inf) {
		printf("-1\n");
	} else {
		printf("%lld\n", (bestturns-1)*n+bestwho+1);
	}
	return 0;
}