This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define f1 first
#define s2 second
#define pb push_back
#define mp make_pair
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=1e6+5;
ll n,a,cnt[N],ans,dizi[N],maxi,maxl,maxr,l,r;
vector<pair<int,int>>v[N];
int main(){
//fri("in.txt");
//fro("out.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a;
cnt[a+i]++;
v[a+i].pb({a,i});
dizi[i]=a;
if(cnt[a+i]>ans){
ans=cnt[a+i];
maxi=a+i;
}
}
for(auto j:v[maxi]){
l=min(j.f1,j.s2);
r=max(j.f1,j.s2);
if(maxl==0 && maxr==0){
maxl=l;
maxr=r;
}
else if(r-l>maxr-maxl){
maxl=l;
maxr=r;
}
}
cout<<dizi[maxl]<<" "<<dizi[maxr]<<endl;
return 0;
}
# | 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... |