Submission #1366285

#TimeUsernameProblemLanguageResultExecution timeMemory
1366285sodooSequence (APIO23_sequence)C++20
0 / 100
2095 ms6488 KiB
#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
int sequence(int N,vector<int> A){
	vector<int> v;
	int mx=0;
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			for(int t=i;t<=j;t++){
				v.push_back(A[t]);
			}
			sort(v.begin(),v.end());
			int n=v.size();
			int sumy=0,sumx=0,y=v[n/2],x=v[n/2+n%2];
			for(int t=0;t<n;t++){
				if(v[t]==y) sumy+=1;
				if(v[t]==x) sumx+=1;
			}
			sumy=max(sumy,sumx);
			mx=max(mx,sumy);
		}
	}
	return mx;
}
#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...