| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333856 | hmms127 | Sequence (APIO23_sequence) | C++20 | 0 ms | 0 KiB |
#include "bits/stdc++.h"
using namespace std;
#define f1(n) for(int i=0;i<n;i++)
#define f3(n) for(int j=0;j<n;j++)
#define f2(m,n,q) for(int i=m;i<n;i++)
#define f4(m,n,q) for(int j=m;j<n;j++)
#define int long long
#define pb push_back
constexpr int N=2e5+5,LOG=21,mod=1e9+7,inf=1e15;
using pr=pair<int,int>;
using ar=array<int,3>;
signed main(){
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int tt=1;//cin>>tt;
while(tt--){
int n;cin>>n;
int a[n];f1(n)cin>>a[i];
sort(a,a+n);
int ans=0;
for (int l=0;l<n;l++) {
vector<int>v;vector<int>frq(n+1,0);
for (int r=l;r<n;r++) {
v.pb(a[r]);
frq[a[r]]++;
sort(v.begin(),v.end());
if ((r-l+1)%2) {
ans=max(ans,frq[v[(int)(v.size()/2)]]);
}
else ans=max({ans,frq[v[(int)(v.size()/2)]],frq[v[(int)(v.size()/2)-1]]});
}
}
cout<<ans;
}
}