#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
const int N = 2050;
int cnt[N];
int tree[N * 4 + 512];
void add(int node, int cl, int cr, int id){
tree[node] ++ ;
if(cl == cr){
return;
}
int mid = (cl + cr) / 2;
if(mid >= id)
add(node * 2, cl, mid, id);
else
add(node * 2 + 1, mid + 1, cr, id);
}
int find_idx(int node, int cl, int cr, int lim){
if(cl == cr) {
return tree[node];
}
int mid = (cl + cr) / 2;
if(tree[node * 2] >= lim){
return find_idx(node * 2, cl, mid, lim);
}
else{
return find_idx(node * 2 + 1, mid + 1, cr, lim - tree[node * 2]);
}
}
void init(int node, int cl, int cr){
tree[node] = 0;
if(cl == cr) return;
int mid = (cl + cr) / 2;
init(node * 2, cl, mid);
init(node * 2 + 1, mid + 1, cr);
}
int sequence(int n, vector<int> a) {
int ans = 0;
int sz;
int me;
for(int i = 0 ; i < n; i ++) {
init(1, 1, n);
for(int j = i ; j < n; j ++) {
add(1, 1, n, a[j]);
sz = j - i + 1;
if(sz % 2 == 1){
me = (sz + 1) / 2;
ans = max(ans, find_idx(1, 1, n, me));
}
else{
me = (sz + 1) / 2;
ans = max(ans, find_idx(1, 1, n, me));
ans = max(ans, find_idx(1, 1, n, me + 1));
}
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
234 ms |
212 KB |
Output is correct |
14 |
Correct |
234 ms |
328 KB |
Output is correct |
15 |
Correct |
130 ms |
316 KB |
Output is correct |
16 |
Correct |
131 ms |
312 KB |
Output is correct |
17 |
Correct |
110 ms |
312 KB |
Output is correct |
18 |
Correct |
237 ms |
336 KB |
Output is correct |
19 |
Correct |
210 ms |
328 KB |
Output is correct |
20 |
Correct |
183 ms |
316 KB |
Output is correct |
21 |
Correct |
204 ms |
316 KB |
Output is correct |
22 |
Correct |
231 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Runtime error |
67 ms |
8284 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Runtime error |
37 ms |
8364 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
46 ms |
8400 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
234 ms |
212 KB |
Output is correct |
14 |
Correct |
234 ms |
328 KB |
Output is correct |
15 |
Correct |
130 ms |
316 KB |
Output is correct |
16 |
Correct |
131 ms |
312 KB |
Output is correct |
17 |
Correct |
110 ms |
312 KB |
Output is correct |
18 |
Correct |
237 ms |
336 KB |
Output is correct |
19 |
Correct |
210 ms |
328 KB |
Output is correct |
20 |
Correct |
183 ms |
316 KB |
Output is correct |
21 |
Correct |
204 ms |
316 KB |
Output is correct |
22 |
Correct |
231 ms |
332 KB |
Output is correct |
23 |
Runtime error |
9 ms |
1748 KB |
Execution killed with signal 11 |
24 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
234 ms |
212 KB |
Output is correct |
14 |
Correct |
234 ms |
328 KB |
Output is correct |
15 |
Correct |
130 ms |
316 KB |
Output is correct |
16 |
Correct |
131 ms |
312 KB |
Output is correct |
17 |
Correct |
110 ms |
312 KB |
Output is correct |
18 |
Correct |
237 ms |
336 KB |
Output is correct |
19 |
Correct |
210 ms |
328 KB |
Output is correct |
20 |
Correct |
183 ms |
316 KB |
Output is correct |
21 |
Correct |
204 ms |
316 KB |
Output is correct |
22 |
Correct |
231 ms |
332 KB |
Output is correct |
23 |
Runtime error |
67 ms |
8284 KB |
Execution killed with signal 11 |
24 |
Halted |
0 ms |
0 KB |
- |