234402026-01-22 21:56:23FoTamasFasor (40)cpp17Wrong answer 12/40300ms1316 KiB
#include <iostream>
using namespace std;

int main()
{
    int n, k;   // fak szama, latotavolsag
    int h[200000];     // fak (N ≤ 200000)

    cin >> n >> k;
    for (int i = 0; i < n; i++)     // beolvasas
        cin >> h[i];

    int lat = -1;
    bool boldog;
    for (int i = 0; i < n; i++)
    {
        boldog = true;
        for (int j = i - k; j <= i + k; j++)    // leelenorzi hogy a legmagasabb fa a latotavolsagaban
            if (h[j] > h[i])
            {
                boldog = false;
                break;
            }
        if (boldog)
        {
            lat = i + 1;
            break;
        }
    }
    cout << lat << endl;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base12/40
1Accepted0/01ms316 KiB
2Accepted0/04ms508 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/21ms316 KiB
7Wrong answer0/22ms324 KiB
8Accepted2/22ms316 KiB
9Wrong answer0/24ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms640 KiB
12Wrong answer0/23ms316 KiB
13Time limit exceeded0/2298ms852 KiB
14Time limit exceeded0/2300ms728 KiB
15Time limit exceeded0/2300ms1112 KiB
16Time limit exceeded0/2300ms1068 KiB
17Time limit exceeded0/2268ms1080 KiB
18Time limit exceeded0/2268ms1076 KiB
19Time limit exceeded0/2268ms1084 KiB
20Time limit exceeded0/2270ms564 KiB
21Time limit exceeded0/2291ms1180 KiB
22Time limit exceeded0/2291ms1316 KiB