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 148 149 150 151 152 153 #include #include #include int n, k; std::vector vals; int P_Inf = 1000*1000*1000 + 1; void solve2() { std::vector left, right; left.reserve(n); right.reserve(n); left[0] = vals[0]; for (int i = 1; i < n; ++i) { left[i] = std::min(left[i - 1], vals[i]); } right[n - 1] = P_Inf; right[n - 2] = vals[n - 1]; for (int i = n - 3; i >= 0; i--) { right[i] = std::max(right[i + 1], vals[i + 1]); } int found = -1; for (int i = 0; i < n; ++i) { if (left[i] >= right[i]) { found = i; break; } } if (found == -1) { std::cout << "NIE\n"; } else { std::cout << "TAK\n"; std::cout << found + 1 << "\n"; } std::cout.flush(); } void solve3() { // szukam prefixowego minimum // lub // szukam sufixowego maximum // // jak nie ma to sie nie da. // jak jest (powiedzmy x) to podział ~|x|~ int found = -1; int prev = vals[0]; for (int i = 1; i < n; ++i) { if (vals[i] <= prev) { found = i; break; } } if (found == -1) { prev = vals[n - 1]; for (int i = n - 2; i >= 0; --i) { if (vals[i] >= prev) { found = i; break; } } } if (found == -1) { std::cout << "NIE\n"; } else { std::cout << "TAK\n"; std::cout << found << " " << found + 1 << "\n"; } std::cout.flush(); } void solve4() { // szukam a b takich ze a >= b. dzielę ~|a|b|~ + ewnetualnie dzielę ~ tak aby były te głupie podziały int found = -1; for (int i = 0; i < n - 1; ++i) { if (vals[i] >= vals[i + 1]) { found = i; break; } } if (found == -1) { std::cout << "NIE\n"; } else { std::cout << "TAK\n"; int to_add = k - 4; if (found == 0) { to_add ++; } if (found == n - 2) { to_add++; } if (found > to_add) { for (int i = 0; i < to_add; ++i) { std::cout << i + 1 << " "; } if (found != 0) { std::cout << found << " "; } std::cout << found + 1; if (found != n - 2) { std::cout << " " << found + 2; } } else { if (found == 0) { to_add--; } for (int i = 0; i < to_add + 3; ++i) { std::cout << i + 1 << " "; } } std::cout << "\n"; } std::cout.flush(); } int main() { std::ios::sync_with_stdio(false); std::cin >> n >> k; vals.reserve(n); for (int i = 0; i < n; ++i) { std::cin >> vals[i]; } if (k == 2) { solve2(); } else if (k == 3) { solve3(); } else { solve4(); } return 0; }