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;
int main()
{
int n;
cin>>n;
vector<int> len[2*n];
vector<int> a;
for (int i=0;i<n;i++)
{
int x;
cin>>x;
a.push_back(x);
a.push_back(0);
}
for (int i=0;i<2*n-1;i+=2)
{
int rc=2*a[i]-2;
len[(i+rc)/2].push_back((i+rc)/2-min(i,rc));
}
int id=0;
for (int i=0;i<2*n-1;i++)
{
if (len[i].size()>len[id].size())
id=i;
}
int mx=0;
for (int i:len[id])
mx=max(mx,i);
cout<<a[id-mx]<<' '<<a[id+mx]<<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... |