Submission #156037

#	Time	Username	Problem	Language	Result	Execution time	Memory
156037		shuvi_dola	JOIOJI (JOI14_joioji)	C++14	95 / 100	63 ms	7944 KiB

joioji

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int cnti[N], cntj[N], cnto[N];
map <pair <int, int>, int> m;
string s;
int n;
int main()
{
	cin >> n;
	cin >> s;
	for(int i = 0; i < n; i++)
	{
		cnti[i] = cnti[i - 1] + (s[i] == 'I');
		cntj[i] = cntj[i - 1] + (s[i] == 'J');
		cnto[i] = cnto[i - 1] + (s[i] == 'O');
		pair <int, int> v1 = {cntj[i] - cnti[i], cntj[i] - cnto[i]};
		if(m[v1] == 0)
			m[v1] = i;
	}
	int ans = 0;
	for(int i = n - 1; i >= 0; i--)
	{
		pair <int, int> v1 = {cntj[i] - cnti[i], cntj[i] - cnto[i]};
		int j = m[v1];
		ans = max(ans, i - j);
	}

	cout << ans;
}

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