146642025-01-26 14:18:3342thebestestLegcsalódottabb versenyző (75 pont)cpp17Wrong answer 70/7532ms508 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, m, most =-1, mosti = -1, maxsz = 0, szeria = 0, maxi = -1; cin >> N;
    for (int j = 0; j < N; j++) {
        cin >> m;
        if (m > most) {
            most = m;
            //cout << j << " " << szeria << " " << maxsz << endl;
            if(szeria > maxsz) {
                maxsz = szeria;
                maxi = mosti;
            }
            szeria = 0;
            mosti = j+1;
        }
        else {
            szeria ++;
        }
    }
    cout << maxi << endl;
}
SubtaskSumTestVerdictTimeMemory
base70/75
1Accepted0/01ms316 KiB
2Accepted0/032ms508 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Wrong answer0/51ms316 KiB
7Accepted5/51ms384 KiB
8Accepted5/51ms316 KiB
9Accepted5/51ms316 KiB
10Accepted5/51ms400 KiB
11Accepted5/51ms316 KiB
12Accepted5/51ms316 KiB
13Accepted5/532ms400 KiB
14Accepted5/532ms400 KiB
15Accepted5/532ms396 KiB
16Accepted5/532ms392 KiB
17Accepted5/532ms316 KiB