Submission #997879

---

Source Code Expand

#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstring>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define F0(i,n) for (int i = 0; i < n; i++)
#define F1(i,n) for (int i = 1; i <= n; i++)
#define CL(a,x) memset(x, a, sizeof(x));
#define SZ(x) ((int)x.size())
const double eps = 1e-10;
const int inf = 1000000009;
int i, j, k, m, n, l;
int ans;
const int N = 100005;
int a[N], b[N];
string s;

int ok() {
	int cnt = 0;
	while (cnt < SZ(s) && s[cnt] == 'M') cnt++;

	int last = 0;
	F1(i, n) {
		if (b[i]) last = i; else {
			if (i - last > cnt) return 0;
		}
	}
	return 1;
}

int main() {
	//freopen("x.in", "r", stdin);
	cin >> n;
	F1(i, n) cin >> a[i];
	cin >> s;

	int P = 1, Q = n;
	while (P < Q) {
		int R = (P + Q + 1) / 2;
		F1(i, n) b[i] = a[i] >= R;
		if (ok()) P = R; else Q = R - 1;
	}
	cout << P << endl;
	return 0;
}

Submission Info

Judge Result