Submission #1690620

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

//RMQ
struct SegTree2 {
    int N;
    vector<int> dat;
    SegTree2() {}
    SegTree2(int n) {
        N = 1;
        while(N < n) N *= 2;
        dat.resize(2 * N, -1);
        // for(int i = 0; i < 2*N-1; i++)
        //     dat[i] = INF;
    }
    // update k th element
    void update(int k, int a) {
        k += N-1; // leaf
        dat[k] = a; 
        while(k > 0) {
            k = (k - 1) / 2;
            dat[k] = max(dat[k*2+1], dat[k*2+2]);
        }
    }
    // min [a, b)
    int query(int a, int b) { return query(a, b, 0, 0, N); }
    int query(int a, int b, int k, int l, int r) {
        if(r <= a or b <= l) return -1;
        if(a <= l and r <= b) return dat[k];
        int m = (l + r) / 2;
        return max(query(a, b, k*2+1, l, m), query(a, b, k*2+2, m, r));
    }
};

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    SegTree2 r(n);
    rep(i, 0, n){
        cin >> a[i];
        r.update(i, a[i]);
    }
    string s;
    cin >> s;
    int cnt = 0;
    rep(i, 0, s.size()) if(s[i] == 'M') cnt++;
    rep(i, 0, n - cnt){
        a[i] = r.query(i, i + cnt + 1);
    }
    int ans = INF;
    rep(i, 0, n - cnt){
        chmin(ans, a[i]);
    }
    cout << ans << endl;
}

Submission Info

Judge Result