145412025-01-14 11:39:42PappMatyasLegcsalódottabb versenyző (75 pont)cpp17Wrong answer 15/7534ms748 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, A[100000] ,maxival = 0, maxilength = 0, save = -1, pos;
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> A[i];
    }
    for(int i = 0; i < n; i++)
    {
        if(A[i] >= maxival)
        {
            maxival = A[i];
        }
        else
        {
            continue;
        }
        pos = 0;
        for(int j = i+1; j < n; j++)
        {
            if(A[j] <= A[i])
            {
                pos++;
            }
            else
            {
                break;
            }
        }
        if(pos > maxilength)
        {
            maxilength = pos;
            save = i+1;
        }
    }
    cout << save;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/75
1Accepted0/01ms500 KiB
2Wrong answer0/034ms564 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Accepted5/51ms316 KiB
6Wrong answer0/51ms508 KiB
7Wrong answer0/51ms540 KiB
8Wrong answer0/51ms316 KiB
9Accepted5/51ms316 KiB
10Wrong answer0/51ms316 KiB
11Wrong answer0/51ms316 KiB
12Wrong answer0/51ms316 KiB
13Accepted5/534ms744 KiB
14Wrong answer0/534ms660 KiB
15Wrong answer0/534ms688 KiB
16Wrong answer0/532ms616 KiB
17Wrong answer0/534ms748 KiB