Submission #1269981

#TimeUsernameProblemLanguageResultExecution timeMemory
1269981Faggi서열 (APIO23_sequence)C++20
11 / 100
2094 ms5868 KiB
#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define fr first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;

int sequence(int N, std::vector<int> A)
{
    ll i, j;
    ll ma=0;
    vector<ll>v;
    for (i = 0; i < sz(A); i++)
    {
        v.resize(0);
        map<ll,ll>ap;
        for (j = i; j < sz(A); j++)
        {
            v.pb(A[j]);
            ap[A[j]]++;
            sort(all(v));
            ma=max(ma,ap[v[sz(v)/2]]);
            ma=max(ma,ap[v[(sz(v)-1)/2]]);
        }
    }
    return ma;
}
#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...