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
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <stack>
#include <cstring>
#include <iomanip>
#include <ctime>
#include <cassert>
using namespace std;
#define pb push_back
#define INF 1001001001
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
#define FORI(i,n) for(int (i)=1;(i)<=(n);++(i))
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define vi vector<int>
#define SZ(x) ((int)((x).size()))
#define fi first
#define se second
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));
#define wez3(n,m,k) int (n),(m),(k); scanf("%d %d %d",&(n),&(m),&(k));
inline void pisz(int n) { printf("%d\n",n); }
template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream& operator<<(ostream &s,vector<T> t){FOR(i,SZ(t))s<<t[i]<<" ";return s; }
#define DBG(vari) cout<<"["<<__LINE__<<"] "<<#vari<<" = "<<(vari)<<endl;
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (__typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define TESTS wez(testow)while(testow--)
#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 REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define IOS ios_base::sync_with_stdio(0););

int n, m;
const int N = 2000007;
const ll LONGINF = 3001001001001001001LL;
int money[N];
char _cycle[N];
int originalCycle[N], cycle[N], f[N];
const int MIL = 1000002;
int mini[N];

ll compute (int index, ll round) {
   return (round - 1) * n + index + 1;
}

int main () {
   scanf("%d", &n);
   FOR(i,n) scanf("%d", money+i);
   scanf("%d", &m);
   scanf("%s", _cycle);
   FOR(i,m) originalCycle[i] = (_cycle[i] == 'W' ? +1 : -1);

   ll res = LONGINF;

   const int g = __gcd(n,m);
   for (int start = 0; start < g; ++start) {

      // zrob cykl
      const int len = m / g;
      for (int i = start, cnt = 0; cnt < len; ++cnt, i = (i + n) % m) {
         cycle[cnt] = originalCycle[i];
      }

      // wylicz f
      f[len] = 0;
      REP(x,1,len) f[len+x] = f[len+x-1] + cycle[x-1];
      REP(x,1,len) f[len-x] = f[len-x+1] - cycle[len-x];

      // wylicz mini
      REP(val,-len,len) mini[MIL+val] = INF;
      REPD(x,2*len,len+1) mini[MIL+f[x]] = x;

      for (int i = start, cnt = 0; cnt < len; ++cnt, i = (i - n%m + m) % m) {
         if (i < n) {
            pii best(INF, INF);
            for (int j = i; j < n; j += m) REMIN(best, mp(money[j], j));
            int realIndex = best.se, realMoney = best.fi;

            // wylicz kiedy zbankrutuje, update res
            // czy zbankrutuje w tym cyklu?
            int val = f[len-cnt] - realMoney;
            if (-len <= val && val <= len && mini[MIL+val] <= len-cnt+len) {
               // tak
               REMIN(res, compute(realIndex, mini[MIL+val] - (len-cnt)));
            } else {
               // nie
               const int loss = -f[2*len];
               if (loss <= 0) {
                  // zyskuje na graniu - nigdy nie zbankrutuje
               } else {
                  // kiedys przegra
                  int to = realMoney / loss + 1, from = 2;
                  while (from <= to) {
                     int mid = (from + to) / 2;
                     // mid-1 pelnych rund + kawalek kolejnej
                     val = f[len-cnt] - (realMoney - (mid-1) * loss);
                     if (realMoney - (mid-1) * loss < 0) {
                        // juz przegral
                        to = mid-1;
                     } else if (-len <= val && val <= len && mini[MIL+val] <= len-cnt+len) {
                        REMIN(res, compute(realIndex, 1LL * len * (mid-1) + mini[MIL+val] - (len-cnt)));
                        to = mid-1;
                     } else {
                        from = mid+1;
                     }
                  }
               }
            }

         } else {
            // ignoruj i bo za duze
         }

         // przesun element z konca cyklu na poczatek
         mini[MIL+f[len-cnt]] = len-cnt;
      }
   }

   cout << ((res == LONGINF) ? -1 : res);
}