Submission #320091

#TimeUsernameProblemLanguageResultExecution timeMemory
320091YJUJOIOJI (JOI14_joioji)C++14
100 / 100
44 ms6256 KiB
#include<bits/stdc++.h> #pragma GCC optimize("unroll-loops,no-stack-protector") using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> pll; const ll MOD=1e9+7; const ll MOD2=998244353; const ll N=2e5+5; const ld pi=3.14159265359; const ll INF=(1LL<<60); #define SQ(i) ((i)*(i)) #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define pb push_back #define mp make_pair #define X first #define Y second #define setp setprecision #define lwb lower_bound #define SZ(_a) (ll)_a.size() ll n,J,O,I,ans; map<pll,ll> m; string s; int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>n>>s; m[mp(0,0)]=0; REP(i,SZ(s)){ if(s[i]=='J')J++; if(s[i]=='O')O++; if(s[i]=='I')I++; if(m.find(mp(J-O,J-I))==m.end())m[mp(J-O,J-I)]=i+1; else ans=max(ans,i+1-m[mp(J-O,J-I)]); } cout<<ans<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...