Submission #577489

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;


int calc(const string &S) {
  int N = S.size();
  deque<int> L, R;
  for (int i = 0; i < N; ++i) {
    if (S[i] == '<') R.push_back(i);
  }
  int res = 0;
  for (int i = 0; i < N; ++i) {
    if (S[i] == '<') R.pop_front();
    int len = 0;
    if (S[i] == '>') {
      if (L.size() < R.size()) { // to left
        len = R[L.size()] + 1;
      } else { // to right
        if (R.size() == 0) len = N - i;
        else len = N - L[R.size()-1];
      }
    }
    res = max(res, len);
    if (S[i] == '>') L.push_front(i);
  }
  return res;
}

int main() {
  int N;
  string S, T;
  while (cin >> N) {
    cin >> S;
    T = S;
    reverse(T.begin(), T.end());
    for (int i = 0; i < T.size(); ++i) {
      if (T[i] == '<') T[i] = '>';
      else T[i] = '<';
    }
    //cout << S << " " << calc(S) << endl;
    //cout << T << " " << calc(T) << endl;
    cout << max(calc(S), calc(T)) << endl;
  }
  return 0;
}

Submission Info

Judge Result