# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50971 | model_code | 스탬프 수집 (JOI16_ho_t2) | C11 | 4 ms | 1420 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 <stdio.h>
int n;
char S[100005];
int Jsum[100005],Isum[100005];
long long max(long long a,long long b){
if(a>b) return a;
return b;
}
int main(){
int i;
scanf("%d%s",&n,S);
for(i=0;i<n;++i){
Jsum[i+1]=Jsum[i]+(S[i]=='J'?1:0);
Isum[i+1]=Isum[i]+(S[i]=='I'?1:0);
}
long long res_O=0;
for(i=1;i<n;++i){
if(res_O<Jsum[i]*(long long)(Isum[n]-Isum[i])){
res_O=Jsum[i]*(long long)(Isum[n]-Isum[i]);
}
}
long long res_J=0,res_I=0;
long long ans=0;
for(i=0;i<n;++i) if(S[i]=='O'){
res_J+=Isum[n]-Isum[i+1];
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... |