제출 #1061054

#제출 시각아이디문제언어결과실행 시간메모리
1061054stdfloat서열 (APIO23_sequence)C++17
11 / 100
2059 ms8060 KiB
#include <bits/stdc++.h> #include "sequence.h" // #include "grader.cpp" using namespace std; #define sz(v) (int)(v).size() int sequence(int n, vector<int> a) { int mx = 0; for (int i = 0; i < n; i++) { vector<int> v; for (int j = i; j < n; j++) { v.push_back(a[j]); vector<int> u = v; sort(u.begin(), u.end()); for (auto x : {((sz(u) - 1) >> 1), (sz(u) >> 1)}) { mx = max(mx, (int)count(u.begin(), u.end(), u[x])); } } } return mx; }
#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...