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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>
#define PRINT true
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    int n, k;
    cin >> n >> k;
    vector<int> v(n), suf(n);
    for (int i = 0; i < n; i++)
        cin >> v[i];
    suf[n - 1] = v[n - 1];
    for (int i = n - 2; i >= 0; i--)
        suf[i] = max(suf[i + 1], v[i]);
    if (k == 2)
    {
        int pref = INT_MAX;
        for (int i = 0; i < n - 1; i++)
        {
            pref = min(pref, v[i]);
            if (pref >= suf[i + 1])
            {
                cout << "TAK\n";
                if (PRINT)
                    cout << i + 1 << '\n';
                return 0;
            }
        }
        cout << "NIE\n";
    }
    else if (k == 3)
    {
        int pref = INT_MAX;
        for (int i = 1; i < n - 1; i++)
        {
            pref = min(pref, v[i - 1]);
            if (pref >= v[i] || suf[i + 1] <= v[i])
            {
                cout << "TAK\n";
                if (PRINT)
                    cout << i << ' ' << i + 1 << '\n';
                return 0;
            }
        }
        cout << "NIE\n";
    }
    else
    {
        vector<int> pp;
        vector<bool> bb(n + 1);
        bool f = 0;
        for (int i = 1; i < n; i++)
        {
            if (v[i] < v[i - 1])
            {
                f = 1;
                pp.push_back(i);
                bb[i] = 1;
                if (i != n - 1)
                {
                    bb[i + 1] = 1;
                    pp.push_back(i + 1);
                }
                if (i != 1)
                {
                    bb[i - 1] = 1;
                    pp.push_back(i - 1);
                }
            }
        }
        if (f == 0)
        {
            cout << "NIE\n";
            return 0;
        }
        cout << "TAK\n";
        for (int i = 1; i < n; i++)
        {
            if (bb[i] == 0)
                pp.push_back(i);
        }
        sort(pp.begin(), pp.end());
        if (PRINT)
        {
            for (auto i : pp)
                cout << i << ' ';
            cout << '\n';
        }
    }
}