#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_mset;
int sequence(int n, vector <int> a){
vector <vector <int>> repe(n+1, vector<int>(n+1));
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
repe[i][j] = repe[i][j-1] + (a[j-1] == i);
}
}
int ans = 0;
for(int i=0; i<n; i++){
ordered_mset st;
for(int j=i; j<n; j++){
st.insert(a[j]);
auto x = st.find_by_order((j-i)/2);
auto y = st.find_by_order((j-i+1)/2);
//cout<<i<<' '<<j<<' '<<*x<<' '<<*y<<endl;
ans = max(ans, repe[*x][j+1]-repe[*x][i]);
ans = max(ans, repe[*y][j+1]-repe[*y][i]);
}
st.clear();
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
488 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
488 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
380 ms |
16472 KB |
Output is correct |
14 |
Correct |
370 ms |
16204 KB |
Output is correct |
15 |
Correct |
373 ms |
16220 KB |
Output is correct |
16 |
Correct |
362 ms |
16220 KB |
Output is correct |
17 |
Correct |
352 ms |
16256 KB |
Output is correct |
18 |
Correct |
354 ms |
16256 KB |
Output is correct |
19 |
Correct |
382 ms |
16216 KB |
Output is correct |
20 |
Correct |
378 ms |
16220 KB |
Output is correct |
21 |
Correct |
383 ms |
16220 KB |
Output is correct |
22 |
Correct |
384 ms |
16220 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
768 ms |
2097152 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Runtime error |
735 ms |
2097152 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
767 ms |
2097152 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
488 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
380 ms |
16472 KB |
Output is correct |
14 |
Correct |
370 ms |
16204 KB |
Output is correct |
15 |
Correct |
373 ms |
16220 KB |
Output is correct |
16 |
Correct |
362 ms |
16220 KB |
Output is correct |
17 |
Correct |
352 ms |
16256 KB |
Output is correct |
18 |
Correct |
354 ms |
16256 KB |
Output is correct |
19 |
Correct |
382 ms |
16216 KB |
Output is correct |
20 |
Correct |
378 ms |
16220 KB |
Output is correct |
21 |
Correct |
383 ms |
16220 KB |
Output is correct |
22 |
Correct |
384 ms |
16220 KB |
Output is correct |
23 |
Runtime error |
710 ms |
2097152 KB |
Execution killed with signal 9 |
24 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
488 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
380 ms |
16472 KB |
Output is correct |
14 |
Correct |
370 ms |
16204 KB |
Output is correct |
15 |
Correct |
373 ms |
16220 KB |
Output is correct |
16 |
Correct |
362 ms |
16220 KB |
Output is correct |
17 |
Correct |
352 ms |
16256 KB |
Output is correct |
18 |
Correct |
354 ms |
16256 KB |
Output is correct |
19 |
Correct |
382 ms |
16216 KB |
Output is correct |
20 |
Correct |
378 ms |
16220 KB |
Output is correct |
21 |
Correct |
383 ms |
16220 KB |
Output is correct |
22 |
Correct |
384 ms |
16220 KB |
Output is correct |
23 |
Runtime error |
768 ms |
2097152 KB |
Execution killed with signal 9 |
24 |
Halted |
0 ms |
0 KB |
- |