Submission #1358469

#TimeUsernameProblemLanguageResultExecution timeMemory
1358469silence25Sequence (APIO23_sequence)C++20
11 / 100
2096 ms4804 KiB
#include "sequence.h"
#include "bits/stdc++.h"

#define ff first
#define ss second
#define pp pop_back
#define ll long long
#define pb push_back
#define ls(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define wr cout << "------------------------" << endl

using namespace std;

int sequence(int n, vector<int> a) {
	int ans = 0;
	for(int l = 0;l<n;++l){
		for(int r = l;r<n;++r){
			vector<int> v;
			multiset<int> st;
			for(int i = l;i<=r;++i) v.pb(a[i]);
			for(auto it:v) st.insert(it);
			sort(all(v));
			int k = ls(v);
			int mid1 = (k - 1) >> 1;
			int mid2 = (k - 1) >> 1;
			mid2 += ((k - 1) % 2);
			ans = max(ans, (int)max(st.count(v[mid1]), st.count(v[mid2])));
		}
	}
	return ans;
}

/*
7
1 2 3 1 2 1 3

9
1 1 2 3 4 3 2 1 1

14
2 6 2 5 3 4 2 1 4 3 5 6 3 2


*/
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...