#include <bits/stdc++.h>
using namespace std;
int main()
{
const int INF = 2e9;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
if (k == 2)
{
vector<int> mini(n);
vector<int> maxi(n);
mini[0] = a[0];
maxi[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
mini[i] = min(a[i], mini[i - 1]);
for (int i = n - 2; i >= 0; i--)
maxi[i] = max(a[i], maxi[i + 1]);
for (int i = 0; i < n - 1; i++)
{
if (mini[i] > maxi[i + 1])
{
cout << "TAK\n";
cout << i + 1 << '\n';
return 0;
}
}
cout << "NIE\n";
}
else if (k == 3)
{
int mini = 0;
int maxi = 0;
for (int i = 0; i < n; i++)
{
if (a[i] <= a[mini])
mini = i;
if (a[maxi] < a[i])
maxi = i;
}
if (mini == 0 && maxi == n - 1)
{
cout << "NIE\n";
return 0;
}
else
{
if (mini != 0)
{
if (mini == n - 1)
{
cout << "TAK\n";
cout << 1 << ' ' << n - 1 << '\n';
return 0;
}
else
{
cout << "TAK\n";
cout << mini << ' ' << mini + 1 << '\n';
}
}
else
{
cout << "TAK\n";
cout << 1 << ' ' << maxi + 1 << '\n';
}
}
}
else
{
for (int i = 1; i < n ; i++)
{
if (a[i] <= a[i - 1])
{
cout << "TAK\n";
if (i == 1)
{
for (int i = 1; i < k; i++)
cout << i << ' ';
cout << '\n';
return 0;
}
if(i == n -1)
{
int res = k - 3;
for (int j = 0; j < res; j++)
{
cout << j + 1 << ' ';
}
res = 0;
cout << i - 2 + 1 << ' ' << i - 1 + 1;
cout << '\n';
return 0;
}
int res = k - 4;
if (i - 2 > res)
{
for (int j = 0; j < res; j++)
{
cout << j + 1 << ' ';
}
res = 0;
}
else
{
for (int j = 0; j < i - 2; j++)
{
res--;
cout << j + 1 << ' ';
}
}
cout << i - 2 + 1 << ' ' << i - 1 + 1 << ' ' << i + 1 << ' ';
if (res)
{
int j = i + 1;
while (res)
{
res--;
cout << j + 1 << ' ';
}
}
cout << '\n';
return 0;
}
}
cout << "NIE\n";
return 0;
}
return 0;
}
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 147 | #include <bits/stdc++.h> using namespace std; int main() { const int INF = 2e9; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } if (k == 2) { vector<int> mini(n); vector<int> maxi(n); mini[0] = a[0]; maxi[n - 1] = a[n - 1]; for (int i = 1; i < n; i++) mini[i] = min(a[i], mini[i - 1]); for (int i = n - 2; i >= 0; i--) maxi[i] = max(a[i], maxi[i + 1]); for (int i = 0; i < n - 1; i++) { if (mini[i] > maxi[i + 1]) { cout << "TAK\n"; cout << i + 1 << '\n'; return 0; } } cout << "NIE\n"; } else if (k == 3) { int mini = 0; int maxi = 0; for (int i = 0; i < n; i++) { if (a[i] <= a[mini]) mini = i; if (a[maxi] < a[i]) maxi = i; } if (mini == 0 && maxi == n - 1) { cout << "NIE\n"; return 0; } else { if (mini != 0) { if (mini == n - 1) { cout << "TAK\n"; cout << 1 << ' ' << n - 1 << '\n'; return 0; } else { cout << "TAK\n"; cout << mini << ' ' << mini + 1 << '\n'; } } else { cout << "TAK\n"; cout << 1 << ' ' << maxi + 1 << '\n'; } } } else { for (int i = 1; i < n ; i++) { if (a[i] <= a[i - 1]) { cout << "TAK\n"; if (i == 1) { for (int i = 1; i < k; i++) cout << i << ' '; cout << '\n'; return 0; } if(i == n -1) { int res = k - 3; for (int j = 0; j < res; j++) { cout << j + 1 << ' '; } res = 0; cout << i - 2 + 1 << ' ' << i - 1 + 1; cout << '\n'; return 0; } int res = k - 4; if (i - 2 > res) { for (int j = 0; j < res; j++) { cout << j + 1 << ' '; } res = 0; } else { for (int j = 0; j < i - 2; j++) { res--; cout << j + 1 << ' '; } } cout << i - 2 + 1 << ' ' << i - 1 + 1 << ' ' << i + 1 << ' '; if (res) { int j = i + 1; while (res) { res--; cout << j + 1 << ' '; } } cout << '\n'; return 0; } } cout << "NIE\n"; return 0; } return 0; } |
English