# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985536 | ag_1204 | Sequence (APIO23_sequence) | C++17 | 2100 ms | 9216 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
void balance(multiset<int> s, multiset<int> t) {
while (s.size() > t.size() + 1) {
t.insert(*s.rbegin());
s.erase(prev(s.end()));
}
while (t.size() > s.size()) {
s.insert(*t.begin());
t.erase(t.begin());
}
}
int sequence(int N, std::vector<int> A) {
int ans=0;
for (int i=0;i<N;i++) {
map<int,int> m;
multiset<int> low, high;
for (int j=i;j<N;j++) {
if (low.empty() || A[j]<=*low.rbegin()) {
low.insert(A[j]);
} else {
high.insert(A[j]);
}
balance(low,high);
m[A[j]]++;
int m1 = *low.rbegin();
int m2 = (low.size()+high.size())%2==0?*high.begin():m1;
int occ1 = m[m1], occ2=m[m2];
ans = max(ans,(max(m1,m2)));
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |