133802025-01-07 18:01:51ercseferencInverziócpp17Wrong answer 35/50185ms6308 KiB
#include <iostream>
//#include <fstream>
#include <vector>
using namespace std;
int main()
{
    int n; //ifstream f("szamok.txt"); f>>n;
    cin>>n;
    int a[n+1],b[n+1]; a[0]=0; b[0]=0;
    for(int i=1; i<=n; i++){cin>>a[i]; b[a[i]]=i;}
    int veg=-1; vector<int>m;
    for(int i=0; i<=n; i++){if(veg<b[i])
        {veg=b[i]; m.push_back(b[i]);}}
    int maxi,kezd,vege,s=-1;
    for(int i=1; i<m.size(); i++){
        maxi=0;
        for(int j=m[i-1]; j<m[i]; j++){if(maxi<a[j]-a[m[i]])maxi=a[j]-a[m[i]];}
        if(maxi>s){s=maxi; kezd=a[m[i]]; vege=maxi+a[m[i]];}}
    if(s==-1)cout<<"-1";
    else cout<<kezd<<" "<<vege;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Wrong answer0/217ms776 KiB
7Accepted2/2175ms4108 KiB
8Accepted2/2181ms4148 KiB
9Accepted2/2185ms4300 KiB
10Wrong answer0/2179ms4172 KiB
11Wrong answer0/2180ms4148 KiB
12Wrong answer0/2175ms4148 KiB
13Accepted2/2180ms4196 KiB
14Accepted2/2178ms4180 KiB
15Accepted2/2175ms4148 KiB
16Accepted2/2180ms4148 KiB
17Wrong answer0/2178ms4148 KiB
18Accepted2/2180ms4260 KiB
19Accepted3/3175ms4100 KiB
20Accepted3/3175ms4108 KiB
21Accepted2/2177ms4148 KiB
22Accepted2/2178ms4076 KiB
23Wrong answer0/2180ms4312 KiB
24Wrong answer0/2179ms6308 KiB