1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k, a;
    cin >> n >> k;
    vector<int> v;

    for (int i = 0; i < n; i++)
    {
        cin >> a;
        v.push_back(a);
    }

    vector<int> ans;

    int start = 0;
    int max = v[0];

    for (int i = 1; i < n; i++)
    {
        if (v[i] > max)
        {
            max = v[i];
            if (i - start + 1 == k)
            {
                cout << "TAK" << endl;
                ans.push_back(i);
                start = i;
            }
            else if (i - start + 1 > k)
            {
                cout << "NIE" << endl;
                return 0;
            }
        }
    }

    for (int i = 0; i < ans.size(); i++)
    {
        cout << ans[i] << " ";
    }
    cout << endl;

    return 0;
}