Submission #975775

#	Time	Username	Problem	Language	Result	Execution time	Memory
975775		XXBabaProBerkay	Sequence (APIO23_sequence)	C++17	11 / 100	2095 ms	7944 KiB

sequence

#include "sequence.h"

#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second

int sequence(int N, vector<int> A)
{
	int ans = 0;
	for (int i = 0; i < N; i++)
		for (int j = i; j < N; j++)
		{
			vector<int> v;
			for (int k = i; k <= j; k++)
				v.push_back(A[k]);

			sort(v.begin(), v.end());

			int x = 0, y = 0;
			for (int k : v)
				if (k == v[(j - i) / 2])
					x++;
				else if (k == v[(j - i + 1) / 2])
					y++;

			if (v[(j - i) / 2] == v[(j - i + 1) / 2])
				x += y;

			ans = max(ans, max(x, y));
		}

	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18