#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int sequence(int n, std::vector<int> a) {
ll mx = 0;
for (int i = 0; i < n; ++i)
{
map < int, ll > m;
int mid = -1, mi = 0;
for (int j = i; j >= 0; --j)
{
++m[a[j]];
if (mid == -1) mid = a[j];
if (a[j] < mid) ++mi;
if ((i - j) / 2 < mi) mid = prev (m.find (mid))->first, mi -= m[mid];
if (mi + m[mid] <= (i - j) / 2) mi += m[mid], mid = next (m.find (mid))->first;
ll ans = m[mid];
if (mi + m[mid] <= (i - j + 1) / 2)
ans = max (ans, next (m.find (mid))->second);
mx = max (mx, ans);
}
}
return mx;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
372 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 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 |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
372 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 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 |
348 KB |
Output is correct |
13 |
Correct |
373 ms |
496 KB |
Output is correct |
14 |
Correct |
360 ms |
592 KB |
Output is correct |
15 |
Correct |
109 ms |
344 KB |
Output is correct |
16 |
Correct |
111 ms |
348 KB |
Output is correct |
17 |
Correct |
41 ms |
348 KB |
Output is correct |
18 |
Correct |
383 ms |
344 KB |
Output is correct |
19 |
Correct |
325 ms |
488 KB |
Output is correct |
20 |
Correct |
262 ms |
700 KB |
Output is correct |
21 |
Correct |
329 ms |
488 KB |
Output is correct |
22 |
Correct |
338 ms |
856 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Execution timed out |
2048 ms |
4752 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 |
2027 ms |
4172 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2058 ms |
4752 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
372 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 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 |
348 KB |
Output is correct |
13 |
Correct |
373 ms |
496 KB |
Output is correct |
14 |
Correct |
360 ms |
592 KB |
Output is correct |
15 |
Correct |
109 ms |
344 KB |
Output is correct |
16 |
Correct |
111 ms |
348 KB |
Output is correct |
17 |
Correct |
41 ms |
348 KB |
Output is correct |
18 |
Correct |
383 ms |
344 KB |
Output is correct |
19 |
Correct |
325 ms |
488 KB |
Output is correct |
20 |
Correct |
262 ms |
700 KB |
Output is correct |
21 |
Correct |
329 ms |
488 KB |
Output is correct |
22 |
Correct |
338 ms |
856 KB |
Output is correct |
23 |
Execution timed out |
2048 ms |
1916 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
372 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 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 |
348 KB |
Output is correct |
13 |
Correct |
373 ms |
496 KB |
Output is correct |
14 |
Correct |
360 ms |
592 KB |
Output is correct |
15 |
Correct |
109 ms |
344 KB |
Output is correct |
16 |
Correct |
111 ms |
348 KB |
Output is correct |
17 |
Correct |
41 ms |
348 KB |
Output is correct |
18 |
Correct |
383 ms |
344 KB |
Output is correct |
19 |
Correct |
325 ms |
488 KB |
Output is correct |
20 |
Correct |
262 ms |
700 KB |
Output is correct |
21 |
Correct |
329 ms |
488 KB |
Output is correct |
22 |
Correct |
338 ms |
856 KB |
Output is correct |
23 |
Execution timed out |
2048 ms |
4752 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |