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
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
#include <iostream>

using namespace std;

int t[500005], min_pref[500005];
bool koniec[500005];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

	int n, k;

	cin >> n >> k;

	for(int i = 0; i < n; ++i)
	{
		cin >> t[i];

		min_pref[i] = t[i];
		if(i) min_pref[i] = min(min_pref[i], min_pref[i - 1]);
	}

    if(k == 3)
    {
        if(t[0] >= t[n - 1])
        {
            cout << "TAK" << "\n";
            cout << 1 << " " << n - 1;
            return 0;
        }
        int mn = t[0];
        bool tak = 0;
        for(int i = 1; i <= n - 2; ++i)
        {
            if(t[i] <= mn)
            {
                koniec[i] = 1;
                koniec[i - 1] = 1;
                tak = 1;
                break;
            }
        }

        int mx = t[n - 1];
        if(!tak)
        {
            for(int i = n - 2; i >= 1; --i)
            {
                if(t[i] >= mx)
                {
                    koniec[i] = 1;
                    koniec[i - 1] = 1;
                    tak = 1;
                    break;
                }
            }
        }

        if(!tak)
        {
            cout << "NIE";
            return 0;
        }

        cout << "TAK" << "\n";
        for(int i = 0; i < n; ++i)
        {
            if(koniec[i]) cout << i + 1 << " ";
        }
        return 0;
    }
    else if(k == 2)
    {
        int mn = min_pref[n - 2];
        int mx = t[n - 1];
        for(int i = n - 2; ~i; --i)
        {
            if(mn >= mx)
            {
                cout << "TAK" << "\n";
                cout << i + 1;
                return 0;
            }

            if(!i) break;

            mn = min_pref[i - 1];
            mx = max(mx, t[i]);
        }
        cout << "NIE" << "\n";
        return 0;
    }

    --k;
    bool tak = 0;
    for(int i = 0; i <= n - 2; ++i)
    {
        if(t[i] >= t[i + 1])
        {
            if(!i)
            {
                koniec[i] = 1;
                koniec[i + 1] = 1;

                k -= 2;
                tak = 1;
            }
            else
            {
                koniec[i - 1] = 1;
                koniec[i] = 1;
                koniec[i + 1] = 1;

                if(i == (n - 2)) k -= 2;
                else k -= 3;
                tak = 1;
            }
            break;
        }
    }

    if(!tak)
    {
        cout << "NIE";
        return 0;
    }

    for(int i = 0; i < n - 1; ++i)
    {
        if(!k) break;

        if(!koniec[i])
        {
            koniec[i] = 1;
            --k;
        }
    }

    cout << "TAK" << "\n";
    for(int i = 0; i < n - 1; ++i)
    {
        if(koniec[i]) cout << i + 1 << " ";
    }
    return 0;
}