Submission #1178412

#TimeUsernameProblemLanguageResultExecution timeMemory
1178412AgageldiSequence (APIO23_sequence)C++20
28 / 100
2095 ms8884 KiB
#include "bits/stdc++.h" #include "sequence.h" // #include "grader.cpp" using namespace std; #define MAX_N 5000005 #define ll long long #define SZ(v) (int)v.size() ll a[MAX_N], n, ans; vector <int> v; int sequence(int N, vector<int> A) { for(int i = 0; i < N; i++) { v.clear(); for(int j = i; j < N; j++) { a[A[j]]++; v.push_back(A[j]); int ind = SZ(v) - 1; while(ind > 0 && v[ind] < v[ind - 1]) { swap(v[ind], v[ind - 1]); ind--; } int med = (SZ(v) / 2); ans = max({ans,a[v[med]],a[v[med - ((j - i + 1) % 2 == 0)]]}); } for(int j = i; j < N; j++) { a[A[j]]--; } } 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...