Submission #1200236

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200236		crispxx	Sequence (APIO23_sequence)	C++20	28 / 100	2095 ms	37588 KiB

sequence

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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define all(x) x.begin(), x.end()
#define pb push_back
#define ar array
#define nl '\n'

#include "sequence.h"
// #include "grader.cpp"

using ordered_set = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;

int sequence(int n, std::vector<int> a) {
	int ans = 0;
	for(int i = 0; i < n; i++) {
		ordered_set st;
		vector<int> cnt(n + 1);
		for(int j = i; j < n; j++) {
			cnt[a[j]]++;
			st.insert({a[j], j});
			int val = st.find_by_order(st.size() / 2) -> first;
			ans = max(ans, cnt[val]);
			if(st.size() % 2 == 0) {
				val = st.find_by_order(st.size() / 2 - 1) -> first;
				ans = max(ans, cnt[val]);
			}
		}
	}
	return ans;
}

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