# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335778 | ChrisT | 스탬프 수집 (JOI16_ho_t2) | C++17 | 5 ms | 3692 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;
const int MN = 1e5 + 5;
char s[MN];
long long jo[MN], oi[MN], jj[MN], ii[MN];
int main() {
int n;
scanf ("%d\n%s",&n,s+1);
long long j = 0, o = 0, i = 0;
for (int k = 1; k <= n; k++) {
if (s[k] == 'J') ++j;
else if (s[k] == 'O') o += j;
else i += o;
jo[k] = o; jj[k] = j;
}
long long tot = i, ret = i;
j = o = i = 0;
for (int k = n; k >= 1; k--) {
if (s[k] == 'I') ++i;
else if (s[k] == 'O') o += i;
else j += o;
oi[k] = o; ii[k] = i;
}
for (int k = 0; k <= n; k++) {
ret = max({ret,tot + oi[k+1],tot + jj[k]*ii[k+1],tot+jo[k]});
}
printf ("%lld\n",ret);
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... |