Submission #12,872

2025-01-02 19:31:22

cpp17

Wrong answer 34/40

43ms

560 KiB

#include <iostream>

using namespace std;

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

    int poz = 1, maxMagassag, hossz = 0;
    cin >> maxMagassag;

    int curr;
    for(int i = 2; i <= N; i++){
        cin >> curr;
        if(curr > maxMagassag){
            maxMagassag = curr;
            hossz = 0;
            poz = i;
        }
        else{
            hossz++;
        }

        if(hossz >= K){
            cout << poz << endl;
            break;
        }
    }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	34/40
		1	Accepted	0/0	1ms	320 KiB
		2	Accepted	0/0	1ms	320 KiB
		3	Accepted	2/2	1ms	320 KiB
		4	Wrong answer	0/2	1ms	320 KiB
		5	Accepted	2/2	1ms	320 KiB
		6	Accepted	2/2	1ms	320 KiB
		7	Accepted	2/2	1ms	560 KiB
		8	Accepted	2/2	1ms	320 KiB
		9	Accepted	2/2	1ms	320 KiB
		10	Accepted	2/2	1ms	320 KiB
		11	Accepted	2/2	1ms	320 KiB
		12	Accepted	2/2	1ms	320 KiB
		13	Accepted	2/2	35ms	508 KiB
		14	Wrong answer	0/2	32ms	320 KiB
		15	Accepted	2/2	39ms	320 KiB
		16	Accepted	2/2	32ms	320 KiB
		17	Accepted	2/2	43ms	320 KiB
		18	Accepted	2/2	32ms	508 KiB
		19	Accepted	2/2	32ms	404 KiB
		20	Wrong answer	0/2	20ms	320 KiB
		21	Accepted	2/2	43ms	320 KiB
		22	Accepted	2/2	32ms	400 KiB