Submission #1168770

#TimeUsernameProblemLanguageResultExecution timeMemory
1168770rayan_bdSequence (APIO23_sequence)C++20
11 / 100
2096 ms5644 KiB
#include <bits/stdc++.h> using namespace std; int sequence(int N, vector<int> A) { int peak = 0; for (int i = 1; i < N; i++) { if (A[i] < A[i - 1]) { peak = i - 1; break; } } int maxW = 0; for (int l = 0; l < N; l++) { unordered_map<int, int> freq; vector<int> sub; for (int r = l; r < N; r++) { sub.push_back(A[r]); freq[A[r]]++; vector<int> sorted_sub = sub; sort(sorted_sub.begin(), sorted_sub.end()); int mid1 = sorted_sub[(sorted_sub.size() - 1) / 2]; int mid2 = sorted_sub[sorted_sub.size() / 2]; maxW = max(maxW, max(freq[mid1], freq[mid2])); } } return maxW; }
#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...