#include <bits/stdc++.h> // Adam Naskręcki using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; int a[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (k == 2) { int mini[n], maxi[n]; mini[1] = a[1]; for (int i = 2; i < n; i++) { mini[i] = min(mini[i - 1], a[i]); } maxi[n - 1] = a[n]; for (int i = n - 2; i > 0; i--) { maxi[i] = max(maxi[i + 1], a[i + 1]); } bool possible = 0; int res; for (int i = 1; i < n; i++) { if (mini[i] >= maxi[i]) { possible = 1; res = i; } } if (possible) { cout << "TAK\n"; cout << res << "\n"; } else { cout << "NIE\n"; } } else if (k == 3) { int mini = a[1]; int maxi = a[1]; for (int i = 2; i <= n; i++) { mini = min(mini, a[i]); maxi = max(maxi, a[i]); } int res = -1; for (int i = 2; i < n && res == -1; i++) { if (a[i] == mini) { res = i; } if (a[i] == maxi) { res = i; } } if (res == -1) { if (a[1] == maxi) { cout << "TAK\n"; cout << 1 << " " << n - 1 << "\n"; } else { cout << "NIE\n"; } } else { cout << "TAK\n"; cout << res - 1 << " " << res << "\n"; } } else { int res = -1; for (int i = 1; i < n && res == -1; i++) { if (a[i] >= a[i + 1]) { res = i; } } if (res == -1) { cout << "NIE\n"; } else { cout << "TAK\n"; if (k <= res + 2) { if (res != n - 1) { for (int i = 1; i <= k - 4; i++) { cout << i << " "; } cout << res - 1 << " " << res << " " << res + 1 << "\n"; } else { for (int i = 1; i <= k - 3; i++) { cout << i << " "; } cout << res - 1 << " " << res << "\n"; } } else { for (int i = 1; i < k - 1; i++) { cout << i << " "; } cout << k - 1 << "\n"; } } } 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 | #include <bits/stdc++.h> // Adam Naskręcki using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; int a[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (k == 2) { int mini[n], maxi[n]; mini[1] = a[1]; for (int i = 2; i < n; i++) { mini[i] = min(mini[i - 1], a[i]); } maxi[n - 1] = a[n]; for (int i = n - 2; i > 0; i--) { maxi[i] = max(maxi[i + 1], a[i + 1]); } bool possible = 0; int res; for (int i = 1; i < n; i++) { if (mini[i] >= maxi[i]) { possible = 1; res = i; } } if (possible) { cout << "TAK\n"; cout << res << "\n"; } else { cout << "NIE\n"; } } else if (k == 3) { int mini = a[1]; int maxi = a[1]; for (int i = 2; i <= n; i++) { mini = min(mini, a[i]); maxi = max(maxi, a[i]); } int res = -1; for (int i = 2; i < n && res == -1; i++) { if (a[i] == mini) { res = i; } if (a[i] == maxi) { res = i; } } if (res == -1) { if (a[1] == maxi) { cout << "TAK\n"; cout << 1 << " " << n - 1 << "\n"; } else { cout << "NIE\n"; } } else { cout << "TAK\n"; cout << res - 1 << " " << res << "\n"; } } else { int res = -1; for (int i = 1; i < n && res == -1; i++) { if (a[i] >= a[i + 1]) { res = i; } } if (res == -1) { cout << "NIE\n"; } else { cout << "TAK\n"; if (k <= res + 2) { if (res != n - 1) { for (int i = 1; i <= k - 4; i++) { cout << i << " "; } cout << res - 1 << " " << res << " " << res + 1 << "\n"; } else { for (int i = 1; i <= k - 3; i++) { cout << i << " "; } cout << res - 1 << " " << res << "\n"; } } else { for (int i = 1; i < k - 1; i++) { cout << i << " "; } cout << k - 1 << "\n"; } } } return 0; } |