제출 #208384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
208384		bensonlzl	JOIOJI (JOI14_joioji)	C++14	100 / 100	74 ms	10276 KiB

joioji

#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pi;

map<pi,vector<int> > m;

int N, curJ = 0, curO = 0, curI = 0;
char x;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> N;
	m[pi(0,0)] = vector<int>(1,0);
	for (int i = 1; i <= N; ++i){
		cin >> x;
		if (x == 'J') curJ++;
		else if (x == 'O') curO++;
		else curI++;
		if (m.find(pi(curO-curJ,curI-curO)) == m.end()){
			m[pi(curO-curJ,curI-curO)] = vector<int>();
		}
		m[pi(curO-curJ,curI-curO)].push_back(i);
	}
	int maxi = 0;
	for (auto it : m){
		maxi = max(maxi,it.second.back()-it.second[0]);
	}
	cout << maxi << '\n';
}

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