Submission #1972356

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
using namespace std;

int N;
string S;

long long I_cou[100010];
long long J_cou[100010];

int main()
{
    cin >> N;
    cin >> S;

    for (int i = 0; i < N; i++)
    {
        if (i > 0)
            J_cou[i] = J_cou[i - 1];
        if (S[i] == 'J')
            J_cou[i]++;
    }

    for (int i = N - 1; i >= 0; i--)
    {
        I_cou[i] = I_cou[i + 1];
        if (S[i] == 'I')
            I_cou[i]++;
    }

    long long O_result = 0;
    long long J_result = 0;
    long long I_result = 0;
    long long sum = 0;
    for (int i = 0; i < N; i++)
    {
        O_result = max(O_result, J_cou[i] * I_cou[i]);
        if (S[i] == 'O')
        {
            sum += J_cou[i] * I_cou[i];
            J_result += I_cou[i];
            I_result += J_cou[i];
        }
    }

    long long result = O_result;

    result = max(result, J_result);

    result = max(result, I_result);

    cout << result + sum << endl;
    return 0;
}

Submission Info

Judge Result