#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;
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]);
m[v[i+j]]++;
sort(w.begin(),w.end());
if (j%2==1){u=max(u,m[w[j/2+i]]);}
else{u=max(u,max(m[w[j/2+i-1]],m[w[j/2+i]]));}
}
}
return(u);
}
# | 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... |