제출 #1197620

#제출 시각아이디문제언어결과실행 시간메모리
119762012345678JOIOJI (JOI14_joioji)C++20
100 / 100
30 ms6096 KiB
#include <bits/stdc++.h> using namespace std; int n, cj, co, ci, ans; string s; map<pair<int, int>, int> mp; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>s; mp[{0, 0}]=-1; for (int i=0; i<n; i++) { if (s[i]=='J') cj++; if (s[i]=='O') co++; if (s[i]=='I') ci++; if (mp.find({co-cj, ci-cj})!=mp.end()) ans=max(ans, i-mp[{co-cj, ci-cj}]); else mp[{co-cj, ci-cj}]=i; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...