171522025-05-26 19:52:39MolnárLegcsalódottabb versenyző (75 pont)cpp17Wrong answer 45/7535ms772 KiB
#include <iostream>
using namespace std;

int main() {
    int N;
    cin >> N;

    int p[100000];
    int i = 0;
    while (i < N) {
        cin >> p[i];
        i++;
    }

    int maxcs = 0;
    int legcsal = -1;
    i = 0;
    while (i < N) {
        int cs = 0;
        int j = i + 1;
        while (j < N && p[j] <= p[i])
            j++;
        if (j < N)
            cs = j - i;
        if (cs > maxcs) {
            maxcs = cs;
            legcsal = i;
        }
        i++;
    }

    if (legcsal == -1)
        cout << -1;
    else
        cout << legcsal + 1;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/75
1Accepted0/01ms316 KiB
2Wrong answer0/034ms564 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Wrong answer0/51ms316 KiB
8Accepted5/51ms316 KiB
9Accepted5/51ms316 KiB
10Wrong answer0/51ms316 KiB
11Accepted5/51ms316 KiB
12Accepted5/51ms316 KiB
13Accepted5/534ms772 KiB
14Wrong answer0/534ms592 KiB
15Wrong answer0/535ms732 KiB
16Wrong answer0/535ms768 KiB
17Wrong answer0/534ms564 KiB