Submission #983249

#	Time	Username	Problem	Language	Result	Execution time	Memory
983249		vjudge1	Sequence (APIO23_sequence)	C++17	28 / 100	1123 ms	2097152 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 ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> 

#define pb push_back

int sequence(int n, std::vector<int> a) {
	int ans = 0;
	int pref[n + 1][n + 1];
	for(int i = 0;i <= n;i++)pref[0][i] = 0;
	for(int i = 0;i < n;i++){
		for(int j = 0;j <= n;j++)pref[i + 1][j] = pref[i][j];
		pref[i + 1][a[i]]++;
	}
	for(int i = 0;i < n;i++){
		ordered_multiset mst;
		for(int j = i;j < n;j++){
			mst.insert(a[j]);
			set<int> st;
			st.insert(*mst.find_by_order((mst.size() - 1) / 2));
			st.insert(*mst.find_by_order((mst.size()) / 2));
			for(auto k : st){
				int cnt = pref[j + 1][k] - pref[i][k];
				ans = max(ans,cnt);
			}
		}
	}
	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