#include <bits/stdc++.h>
using namespace std;
int sequence(int n, vector<int> a) {
vector<int> pos[n + 1];
for (int i = 0; i < n; i++) pos[a[i]].emplace_back(i);
int res = 0;
for (int val = 1; val <= n; val++) {
for (int L = 1; L <= n; L++) {
int c1 = 0, c2 = 0;
for (int R = L; R <= n; R++) {
c1 += (a[R] < val), c2 += (a[R] > val);
if(abs(c1 - c2) <= (R - L + 1) - (c1 + c2) && (R - L + 1) > c1 + c2){
res = max(res, R - L + 1 - c1 - c2);
}
}
}
}
return res;
}
//int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(nullptr), cout.tie(nullptr);
// int N;
// cin >> N;
// vector<int> A(N);
// for (int i = 0; i < N; i++) cin >> A[i];
// cout << sequence(N, A);
// return 0;
//}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Execution timed out |
2020 ms |
25936 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2040 ms |
31668 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 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |