#include "sequence.h"
#include <bits/stdc++.h>
int sequence(int N, std::vector<int> A) {
int ans = 1;
for (int i = 0; i < N; i++) {
std::map<int, int> mp;
std::multiset<int> s;
mp[A[i]]++;
s.insert(A[i]);
auto it = s.begin();
int idx = 0;
for (int j = i + 1; j < N; j++) {
s.insert(A[j]);
mp[A[j]]++;
if (A[j] < *it) {
idx++;
}
int med_idx = s.size() / 2;
if (idx < med_idx) {
it++;
idx++;
}
if (idx > med_idx) {
it--;
idx--;
}
ans = std::max(ans, mp[*it]);
if (s.size() % 2 == 0) {
ans = std::max(ans, mp[*std::prev(it)]);
}
}
}
return ans;
}
#ifdef LOCAL
#include <cassert>
#include <cstdio>
#include <vector>
int main() {
int N;
assert(1 == scanf("%d", &N));
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
assert(1 == scanf("%d", &A[i]));
}
int result = sequence(N, A);
printf("%d\n", result);
return 0;
}
#endif
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
436 KB |
Output is correct |
8 |
Correct |
2 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
436 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
436 KB |
Output is correct |
8 |
Correct |
2 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
436 KB |
Output is correct |
13 |
Correct |
459 ms |
600 KB |
Output is correct |
14 |
Correct |
445 ms |
600 KB |
Output is correct |
15 |
Correct |
274 ms |
548 KB |
Output is correct |
16 |
Correct |
271 ms |
348 KB |
Output is correct |
17 |
Correct |
206 ms |
348 KB |
Output is correct |
18 |
Correct |
376 ms |
624 KB |
Output is correct |
19 |
Correct |
420 ms |
344 KB |
Output is correct |
20 |
Correct |
405 ms |
344 KB |
Output is correct |
21 |
Correct |
430 ms |
596 KB |
Output is correct |
22 |
Correct |
424 ms |
576 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Execution timed out |
2007 ms |
45976 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Execution timed out |
2031 ms |
28604 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2083 ms |
54476 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
436 KB |
Output is correct |
8 |
Correct |
2 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
436 KB |
Output is correct |
13 |
Correct |
459 ms |
600 KB |
Output is correct |
14 |
Correct |
445 ms |
600 KB |
Output is correct |
15 |
Correct |
274 ms |
548 KB |
Output is correct |
16 |
Correct |
271 ms |
348 KB |
Output is correct |
17 |
Correct |
206 ms |
348 KB |
Output is correct |
18 |
Correct |
376 ms |
624 KB |
Output is correct |
19 |
Correct |
420 ms |
344 KB |
Output is correct |
20 |
Correct |
405 ms |
344 KB |
Output is correct |
21 |
Correct |
430 ms |
596 KB |
Output is correct |
22 |
Correct |
424 ms |
576 KB |
Output is correct |
23 |
Execution timed out |
2011 ms |
7504 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
436 KB |
Output is correct |
8 |
Correct |
2 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
436 KB |
Output is correct |
13 |
Correct |
459 ms |
600 KB |
Output is correct |
14 |
Correct |
445 ms |
600 KB |
Output is correct |
15 |
Correct |
274 ms |
548 KB |
Output is correct |
16 |
Correct |
271 ms |
348 KB |
Output is correct |
17 |
Correct |
206 ms |
348 KB |
Output is correct |
18 |
Correct |
376 ms |
624 KB |
Output is correct |
19 |
Correct |
420 ms |
344 KB |
Output is correct |
20 |
Correct |
405 ms |
344 KB |
Output is correct |
21 |
Correct |
430 ms |
596 KB |
Output is correct |
22 |
Correct |
424 ms |
576 KB |
Output is correct |
23 |
Execution timed out |
2007 ms |
45976 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |