146632025-01-26 14:18:1342thebestestLegcsalódottabb versenyző (75 pont)cpp17Wrong answer 0/7532ms512 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
base0/75
1Wrong answer0/01ms316 KiB
2Wrong answer0/032ms316 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/51ms316 KiB
6Wrong answer0/51ms316 KiB
7Wrong answer0/51ms316 KiB
8Wrong answer0/51ms316 KiB
9Wrong answer0/51ms316 KiB
10Wrong answer0/51ms500 KiB
11Wrong answer0/51ms316 KiB
12Wrong answer0/51ms316 KiB
13Wrong answer0/532ms400 KiB
14Wrong answer0/532ms356 KiB
15Wrong answer0/532ms316 KiB
16Wrong answer0/532ms316 KiB
17Wrong answer0/532ms512 KiB