#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e5+5;
int ar[maxn];
int lk[maxn];
signed main() {
//freopen("a.in", "r", stdin);
//freopen("a.out", "w", stdout);
int N;
cin >> N;
int res = 0;
int a = -1, b = -1;
for(int i = 1; i <= N; i++) { cin >> ar[i]; lk[ar[i]] = i;}
for(int i = 1; i <= N; i++) {
for(int j = i; j <= N; j++) {
reverse(ar+i, ar+j+1);
int cnt = 0;
for(int k = 1; k <= N; k++) if(ar[k] == k) cnt++;
reverse(ar+i, ar+j+1);
if(cnt > res) a = ar[i], b = ar[j], res = cnt;
}
}
cout << a << ' ' << b << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
308 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
212 KB |
Output is correct |
2 |
Correct |
32 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1072 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1086 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1084 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1085 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1088 ms |
1504 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1088 ms |
7372 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1056 ms |
4452 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |