# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901307 | tkm_algorithms | Sequence (APIO23_sequence) | C++17 | 2097 ms | 9384 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;
int sequence(int n, vector<int> a) {
int ans = 0;
for (int i = 0; i < n; ++i) {
multiset<int> x;
for (int j = i; j < n; ++j) {
x.insert(a[j]);
int cnt = 0;
int a = (i - j) >> 1;
int b = (i - j + 1) >> 1;
int c1 = 0, c2 = 0;
for (auto k: x) {
if (cnt == a)
c1 = k;
if (cnt == b) {
c2 = k;
break;
}
++cnt;
}
if (x.count(c1) > ans)
ans = x.count(c1);
if (x.count(c2) > ans)
ans = x.count(c2);
}
}
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... |