# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
947722 | 2024-03-16T23:31:45 Z | Volvox123 | JOIOJI (JOI14_joioji) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; unordered_map<int, int> counter; int main() { int n; cin >> n; string poem; cin >> poem; int max_length = 0; counter[0] = -1; int diff = 0; for (int i = 0; i < n; i++) { if (poem[i] == 'J') { diff++; } else if (poem[i] == 'O') { diff--; } if (counter.find(diff) != counter.end()) { max_length = max(max_length, i - counter[diff]); } else { counter[diff] = i; } } cout << max_length << endl; return 0; }