#include <bits/stdc++.h>
#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N;
string str;
ll ans = 0;
ll J = 0, I = 0;
ll ans2;
int main(){
cin>>N;
cin>>str;
ll A=0, B=0;
for(int i=0; i<N; i++){
if(str[i]=='J'){
J++;
A++;
}else if(str[i]=='O'){
B+=A;
}else{
I++;
ans2 += B;
}
}
ans = max(ans, B);
A = B = 0;
ll i=0, j=0;
for(int t=N-1; t>=0; t--){
if(str[t]=='I'){
i++;
A++;
}else if(str[t]=='O'){
B+=A;
}else{
j++;
}
ans = max(ans, i * (J-j));
}
ans = max(ans, B);
cout<<ans + ans2;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
256 KB |
Output is correct |
| 3 |
Correct |
2 ms |
256 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
256 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
256 KB |
Output is correct |
| 11 |
Correct |
2 ms |
384 KB |
Output is correct |
| 12 |
Correct |
2 ms |
256 KB |
Output is correct |
| 13 |
Correct |
2 ms |
512 KB |
Output is correct |
| 14 |
Correct |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
256 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
256 KB |
Output is correct |
| 3 |
Correct |
2 ms |
256 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
256 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
256 KB |
Output is correct |
| 11 |
Correct |
2 ms |
384 KB |
Output is correct |
| 12 |
Correct |
2 ms |
256 KB |
Output is correct |
| 13 |
Correct |
2 ms |
512 KB |
Output is correct |
| 14 |
Correct |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
256 KB |
Output is correct |
| 16 |
Correct |
2 ms |
256 KB |
Output is correct |
| 17 |
Correct |
2 ms |
384 KB |
Output is correct |
| 18 |
Correct |
2 ms |
256 KB |
Output is correct |
| 19 |
Correct |
2 ms |
384 KB |
Output is correct |
| 20 |
Correct |
2 ms |
384 KB |
Output is correct |
| 21 |
Correct |
2 ms |
256 KB |
Output is correct |
| 22 |
Correct |
2 ms |
256 KB |
Output is correct |
| 23 |
Correct |
2 ms |
256 KB |
Output is correct |
| 24 |
Correct |
2 ms |
256 KB |
Output is correct |
| 25 |
Correct |
2 ms |
256 KB |
Output is correct |
| 26 |
Correct |
2 ms |
256 KB |
Output is correct |
| 27 |
Correct |
2 ms |
256 KB |
Output is correct |
| 28 |
Correct |
2 ms |
256 KB |
Output is correct |
| 29 |
Correct |
2 ms |
256 KB |
Output is correct |
| 30 |
Correct |
2 ms |
404 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
256 KB |
Output is correct |
| 3 |
Correct |
2 ms |
256 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
256 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
256 KB |
Output is correct |
| 11 |
Correct |
2 ms |
384 KB |
Output is correct |
| 12 |
Correct |
2 ms |
256 KB |
Output is correct |
| 13 |
Correct |
2 ms |
512 KB |
Output is correct |
| 14 |
Correct |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
256 KB |
Output is correct |
| 16 |
Correct |
2 ms |
256 KB |
Output is correct |
| 17 |
Correct |
2 ms |
384 KB |
Output is correct |
| 18 |
Correct |
2 ms |
256 KB |
Output is correct |
| 19 |
Correct |
2 ms |
384 KB |
Output is correct |
| 20 |
Correct |
2 ms |
384 KB |
Output is correct |
| 21 |
Correct |
2 ms |
256 KB |
Output is correct |
| 22 |
Correct |
2 ms |
256 KB |
Output is correct |
| 23 |
Correct |
2 ms |
256 KB |
Output is correct |
| 24 |
Correct |
2 ms |
256 KB |
Output is correct |
| 25 |
Correct |
2 ms |
256 KB |
Output is correct |
| 26 |
Correct |
2 ms |
256 KB |
Output is correct |
| 27 |
Correct |
2 ms |
256 KB |
Output is correct |
| 28 |
Correct |
2 ms |
256 KB |
Output is correct |
| 29 |
Correct |
2 ms |
256 KB |
Output is correct |
| 30 |
Correct |
2 ms |
404 KB |
Output is correct |
| 31 |
Correct |
5 ms |
640 KB |
Output is correct |
| 32 |
Correct |
5 ms |
640 KB |
Output is correct |
| 33 |
Correct |
6 ms |
640 KB |
Output is correct |
| 34 |
Correct |
5 ms |
640 KB |
Output is correct |
| 35 |
Correct |
6 ms |
640 KB |
Output is correct |
| 36 |
Correct |
7 ms |
640 KB |
Output is correct |
| 37 |
Correct |
7 ms |
640 KB |
Output is correct |
| 38 |
Correct |
7 ms |
640 KB |
Output is correct |
| 39 |
Correct |
6 ms |
640 KB |
Output is correct |
| 40 |
Correct |
6 ms |
640 KB |
Output is correct |
| 41 |
Correct |
6 ms |
640 KB |
Output is correct |
| 42 |
Correct |
6 ms |
640 KB |
Output is correct |
| 43 |
Correct |
6 ms |
768 KB |
Output is correct |
| 44 |
Correct |
6 ms |
640 KB |
Output is correct |
| 45 |
Correct |
5 ms |
640 KB |
Output is correct |
