248612026-02-16 08:35:34Kornel2025Legcsalódottabb versenyző (75 pont)cpp17Wrong answer 70/7545ms5892 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, maxi=0;
    cin >> n;
    vector<vector<int>> v(n, vector<int>(2));
    for(int i=0; i<n; i++)
    {
        cin >> v[i][0];
        if(v[i][0]>maxi) 
        {
            maxi=v[i][0];
            v[i][1]=-1;
        }
    }
    int akt=-1;
    maxi=0;
    int maxh=-1;
    for(int i=n-1; i>=0; i--)
    {
        if(v[i][1]==-1) akt=i;
        if(akt==-1) continue;
        if(akt-i>=maxi) 
        {
            maxi=akt-i;
            maxh=i;
        }
    }
    if(maxh==0) cout << "-1";
    else cout << maxh;
}
SubtaskSumTestVerdictTimeMemory
base70/75
1Accepted0/01ms316 KiB
2Accepted0/043ms5684 KiB
3Accepted5/51ms500 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms508 KiB
6Wrong answer0/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms316 KiB
9Accepted5/51ms316 KiB
10Accepted5/51ms508 KiB
11Accepted5/51ms316 KiB
12Accepted5/51ms316 KiB
13Accepted5/545ms5856 KiB
14Accepted5/543ms5892 KiB
15Accepted5/543ms5884 KiB
16Accepted5/543ms5888 KiB
17Accepted5/543ms5804 KiB