# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146749 | TadijaSebez | 스탬프 수집 (JOI16_ho_t2) | C++11 | 6 ms | 1312 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;
#define ll long long
const int N=100050;
char s[N];
ll Calc(int l, int r)
{
ll J=0,O=0,I=0;
for(int i=l;i<=r;i++)
{
if(s[i]=='J') J++;
if(s[i]=='O') O+=J;
if(s[i]=='I') I+=O;
}
return I;
}
int J[N],I[N];
int main()
{
int n;
scanf("%i",&n);
scanf("%s",s+1);
s[0]='J';s[n+1]='I';
ll ans=max(Calc(0,n),Calc(1,n+1));
ll tmp=Calc(1,n);
for(int i=1;i<=n;i++) J[i]=J[i-1]+(s[i]=='J');
for(int i=n;i>=1;i--) I[i]=I[i+1]+(s[i]=='I');
for(int i=1;i<=n;i++) ans=max(ans,tmp+(ll)J[i]*I[i+1]);
printf("%lld\n",ans);
return 0;
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... |