Submission #1200195

#TimeUsernameProblemLanguageResultExecution timeMemory
1200195tegshzayaSequence (APIO23_sequence)C++20
0 / 100
2094 ms5588 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; 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){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 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...