#include <iostream> #include <string> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = -1; if (k == 2) { int max_a[n], min_a[n]; max_a[n - 1] = a[n - 1]; min_a[0] = a[0]; for (int i = 1; i < n; i++) { min_a[i] = min(a[i], min_a[i-1]); max_a[n - 1 - i] = max(a[n - 1 - i], max_a[n - i]); } for (int i = 1; i < n; i++) { if (min_a[i - 1] >= max_a[i]) { ans = i - 1; break; } } if (ans == -1) { cout << "NIE\n"; } else { cout << "TAK\n" << ans + 1 << "\n"; } return 0; } if (k == 3) { for (int i = 1; i < n; i++) { if (a[i] <= a[0]) { ans = i; break; } } if (ans != -1) { if (ans == n - 1) { cout << "TAK\n" << 1 << " " << ans << "\n"; } else { cout << "TAK\n" << ans << " " << ans + 1 << "\n"; } return 0; } for (int i = n - 2; i >= 0; i--) { if (a[i] >= a[n - 1]) { ans = i; break; } } if (ans != -1) { if (ans == 0) { cout << "TAK\n" << 1 << " " << 2 << "\n"; } else { cout << "TAK\n" << ans << " " << ans + 1 << "\n"; } return 0; } cout << "NIE\n"; return 0; } for (int i = 1; i < n; i++) { if (a[i - 1] >= a[i]) { ans = i; break; } } if (ans == -1) { cout << "NIE\n"; return 0; } bool slice[n]; for (int i = 0; i < n; i++) { slice[i] = false; } k--; if (ans > 1) { slice[ans - 2] = true; k--; } slice[ans - 1] = true; k--; if (ans < n - 1) { slice[ans] = true; k--; } cout << "TAK\n"; bool space = false; for (int i = 0; i < n - 1; i++) { if (slice[i] == false && k > 0) { slice[i] = true; k--; } if (slice[i]) { if (space) cout << " "; cout << i + 1; space = true; } } cout << "\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 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 | #include <iostream> #include <string> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = -1; if (k == 2) { int max_a[n], min_a[n]; max_a[n - 1] = a[n - 1]; min_a[0] = a[0]; for (int i = 1; i < n; i++) { min_a[i] = min(a[i], min_a[i-1]); max_a[n - 1 - i] = max(a[n - 1 - i], max_a[n - i]); } for (int i = 1; i < n; i++) { if (min_a[i - 1] >= max_a[i]) { ans = i - 1; break; } } if (ans == -1) { cout << "NIE\n"; } else { cout << "TAK\n" << ans + 1 << "\n"; } return 0; } if (k == 3) { for (int i = 1; i < n; i++) { if (a[i] <= a[0]) { ans = i; break; } } if (ans != -1) { if (ans == n - 1) { cout << "TAK\n" << 1 << " " << ans << "\n"; } else { cout << "TAK\n" << ans << " " << ans + 1 << "\n"; } return 0; } for (int i = n - 2; i >= 0; i--) { if (a[i] >= a[n - 1]) { ans = i; break; } } if (ans != -1) { if (ans == 0) { cout << "TAK\n" << 1 << " " << 2 << "\n"; } else { cout << "TAK\n" << ans << " " << ans + 1 << "\n"; } return 0; } cout << "NIE\n"; return 0; } for (int i = 1; i < n; i++) { if (a[i - 1] >= a[i]) { ans = i; break; } } if (ans == -1) { cout << "NIE\n"; return 0; } bool slice[n]; for (int i = 0; i < n; i++) { slice[i] = false; } k--; if (ans > 1) { slice[ans - 2] = true; k--; } slice[ans - 1] = true; k--; if (ans < n - 1) { slice[ans] = true; k--; } cout << "TAK\n"; bool space = false; for (int i = 0; i < n - 1; i++) { if (slice[i] == false && k > 0) { slice[i] = true; k--; } if (slice[i]) { if (space) cout << " "; cout << i + 1; space = true; } } cout << "\n"; return 0; } |