#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> a){
int aa=0,c[105],mx=0;
bool bb[105];
for(int i=0;i<n;i++){
vector<int> ss;ss.pb(a[i]);
for(int j=i+1;j<n;j++){
ss.pb(a[j]);
sort(ss.begin(),ss.end());
int med=0,meds=0,cm=0,mc=0;
if(ss.size()%2==0){
med=ss[ss.size()/2];
meds=ss[ss.size()/2+1];
for(int t=0;t<ss.size();t++){
if(ss[t]==med) cm++;
if(ss[t]==meds) mc++;
}
mx=max(mx,max(cm,mc));
}
else{
med=ss[ss.size()/2+1];
for(int t=0;t<ss.size();t++){
if(ss[t]==med) cm++;
}
mx=max(mx,cm);
}
}
}
return mx;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |