249562026-02-17 09:19:02Kornel2025Legcsalódottabb versenyző (75 pont)cpp17Wrong answer 10/7546ms5888 KiB
#include <bits/stdc++.h>
using namespace std;
main()
{
    int n, maxi=0, maxh=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;
            maxh=i;
        }
    }
    maxi=-1;
    for(int i=maxh-1; i>=0 ; i--)
    {
        if(v[i][1]==1)
        {
            maxi=max(maxi, maxh-i);
            maxh=i;
        }
    }
    cout << maxi;
}
SubtaskSumTestVerdictTimeMemory
base10/75
1Accepted0/01ms316 KiB
2Wrong answer0/043ms5684 KiB
3Wrong answer0/51ms500 KiB
4Accepted5/51ms508 KiB
5Wrong answer0/51ms316 KiB
6Accepted5/51ms500 KiB
7Wrong answer0/51ms500 KiB
8Wrong answer0/51ms316 KiB
9Wrong answer0/51ms316 KiB
10Wrong answer0/51ms316 KiB
11Wrong answer0/51ms552 KiB
12Wrong answer0/52ms528 KiB
13Wrong answer0/543ms5876 KiB
14Wrong answer0/543ms5684 KiB
15Wrong answer0/546ms5888 KiB
16Wrong answer0/545ms5744 KiB
17Wrong answer0/543ms5684 KiB