131792025-01-06 20:52:40ercseferencInverziócpp17Wrong answer 38/50182ms6312 KiB
#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int 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])maxi=a[j];}
        if(maxi-a[m[i]]>s){s=maxi-a[m[i]]; kezd=a[m[i]]; vege=maxi;}}
    if(s==-1)cout<<"-1";
    else cout<<kezd<<" "<<vege;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base38/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Wrong answer0/217ms744 KiB
7Accepted2/2175ms4148 KiB
8Accepted2/2181ms4176 KiB
9Accepted2/2182ms4084 KiB
10Wrong answer0/2180ms4148 KiB
11Wrong answer0/2179ms4148 KiB
12Wrong answer0/2175ms4148 KiB
13Accepted2/2178ms4172 KiB
14Accepted2/2179ms4148 KiB
15Accepted2/2177ms4148 KiB
16Accepted2/2179ms4068 KiB
17Wrong answer0/2178ms4176 KiB
18Accepted2/2180ms4248 KiB
19Accepted3/3175ms4148 KiB
20Accepted3/3174ms4320 KiB
21Accepted2/2174ms4160 KiB
22Accepted2/2178ms4260 KiB
23Wrong answer0/2180ms4384 KiB
24Accepted2/2180ms6312 KiB