This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/// isA AC
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
#define tc int tttttt;cin>>tttttt;while(tttttt--)
#define sumrange(l,r,arr) (l==0?arr[r]:arr[r]-arr[l-1])
#define all(v) v.begin(),v.end()
int main(){
ACPLS();
int n;
cin>>n;
int a[n+1];
int cnt=0;
for(int i = 1; i <= n; i++){
cin>>a[i];
if(a[i]==i){
++cnt;
}
}
int ans=0;
pair<int,int> best={1,1};
for(int i = 1; i <= n; i++){
for(int j = i+1; j <= n; j++){
int res=0;
for(int k = i; k <= j; k++){
if(i-j%2==0&&k==(i+j)/2)
continue;
if(a[k]==k)--res;
if(a[k]==j-k+i)++res;
}
if(res>ans){
ans=res;
best={i,j};
}
}
}
cout<<best.second<<' '<<best.first;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |