Submission #998010

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
typedef vector<char> vc;
typedef vector<vector<char> > vvc;
typedef vector<double> vd;
typedef vector<vector<double> > vvd;
template<class T> using vv=vector<vector< T > >;
typedef deque<int> di;
typedef deque<deque<int> > ddi;
typedef deque<bool> db;
typedef deque<deque<bool> > ddb;

int main() {
  int n;
  cin >> n;
  vi a(n);
  rep (i, n) {
    cin >> a[i];
  }

  string s;
  cin >> s;
  int M, m;
  M = 0;
  rep (i, n-1) {
    if (s[i] == 'M') {
      M += 1;
    } else {
      break;
    }
  }
  m = n-1 - M;
  vi maxM(n-M, 0);
  rep (i, n) {
    for (int j = max(0, i-M); j <= min(i, n-M-1); ++j) {
      maxM[j] = max(maxM[j], a[i]);
    }
  }
  rep (i, n) {
    for (int j = max(0, i-M); j <= min(i, n-M-1); ++j) {
      maxM[j] = max(maxM[j], a[i]);
    }
  }
  sort(all(maxM));
  printf("%d\n", maxM[0]);

  return 0;
}

Submission Info

Judge Result