# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136951 | ksmzzang2003 | 스탬프 수집 (JOI16_ho_t2) | C++14 | 2 ms | 380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
string A;
ll pi[100003],pj[100003],po[100003],rpi[100003],rpo[100003],rpj[100003];
ll j,o,i,ret=0;
int main() {
cin>>N>>A;
for(ll i=0; i<N; i++) {
pj[i] = ((i>0)?pj[i-1]:0) +(A[i]=='J');
po[i] = ((i>0)?po[i-1]:0) +(A[i]=='O');
pi[i] = ((i>0)?pi[i-1]:0) +(A[i]=='I');
}
ll maxv = 0;
for(ll i=N-1; i>=0; i--) {
rpi[i] = rpi[i+1]+(A[i]=='I');
rpj[i] = rpj[i+1]+(A[i]=='J');
rpo[i] = rpo[i+1]+(A[i]=='O');
}
for(ll i=0;i<N;i++) if(A[i]=='O') o+=pj[i]*rpi[i],maxv=max(maxv,pj[i]*rpi[i]); o+=maxv; ret = max(ret,o);
o=0;
string B = A;
A='J'+B; N++;
for(ll i=0; i<N; i++) {
pj[i] = ((i>0)?pj[i-1]:0)+(A[i]=='J');
po[i] = ((i>0)?po[i-1]:0)+(A[i]=='O');
pi[i] = ((i>0)?pi[i-1]:0)+(A[i]=='I');
}
for(ll i=N-1; i>=0; i--) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |