Submission #1333858

#TimeUsernameProblemLanguageResultExecution timeMemory
1333858hmms127Sequence (APIO23_sequence)C++20
0 / 100
2091 ms6520 KiB
#include "sequence.h"
#include <vector>
#include "bits/stdc++.h"
#define pb push_back
using namespace std;
int sequence(int n, vector<int> a) {
    sort(a.begin(),a.end());
    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]]});
        }
    }
    return ans;
}
#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...