제출 #156045

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156045		atoiz	JOIOJI (JOI14_joioji)	C++14	100 / 100	32 ms	3944 KiB

joioji

#include <iostream>
#include <unordered_map>
#include <algorithm>

using namespace std;

unordered_map<long long, int> min_idx;
const int MAXN = 200007;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;

    long long cur = 0;
    min_idx[cur] = 0;

    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        char ch;
        cin >> ch;
        if (ch == 'I') cur += 1;
        else if (ch == 'O') cur += MAXN;
        else cur -= MAXN + 1;

        int min_i = (min_idx.find(cur) == min_idx.end() ? (min_idx[cur] = i) : min_idx[cur]);
        ans = max(ans, i - min_i);
    }
    cout << ans << endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 80 / 80