Submission #1200200

#TimeUsernameProblemLanguageResultExecution timeMemory
1200200tegshzaya서열 (APIO23_sequence)C++20
0 / 100
2096 ms4940 KiB
#include<bits/stdc++.h>
#define ll long long
#define ss second
#define ff first
#define endl "\n"
#define pb push_back
using namespace std;
int sequence(int n,vector<int> v){int u=0,e,f;
	map<int,int> m;
	vector<int> w;
	for (int i=0; i<n; i++)
	{w.clear();
	m.clear();
		for (int j=1; j<=n-i; j++)
		{w.push_back(v[i+j-1]);
		m[v[i+j-1]]++;
		sort(w.begin(),w.end());
		if (j%2==1){e=m.count(w[j/2]);u=max(u,e);}
		else{e=m.count(w[j/2-1]);f=m.count(w[j/2]);u=max(u,(e,f));}
		}
	}
	return(u);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...