#include <iostream> #include <vector> #include <map> #include <set> int n, k; std::vector<int> v; int main() { std::ios_base::sync_with_stdio(0); std::cin >> n >> k; v.resize(n); for (int i = 0; i < n; ++i) { std::cin >> v[i]; } bool inc = true; for (int i = 1; i < n; ++i) { if (v[i - 1] >= v[i]) { inc = false; break; } } if (inc) { std::cout << "NIE"; return 0; } if (k == 2) { std::multiset<int> A, B; for (int i = 1; i < n; ++i) { B.insert(v[i]); } A.insert(v[0]); for (int i = 1; i < n; ++i) { if (*A.begin() >= *B.rbegin()) { std::cout << "TAK\n"; std::cout << i; return 0; } A.insert(v[i]); B.erase(B.lower_bound(v[i])); } std::cout << "NIE"; return 0; } if (k == 3) { for (int i = 1; i < n - 1; ++i) { if (v[0] >= v[i] || v[i] >= v[n - 1]) { std::set<int> S; S.insert(i - 1); S.insert(i); std::cout << "TAK\n"; for (int x : S) std::cout << x + 1 << ' '; return 0; } } std::cout << "NIE"; return 0; } if (k >= 4) { for (int i = 1; i < n; ++i) { if (v[i] <= v[i - 1]) { std::set<int> S; if (i != 1) S.insert(i - 2); S.insert(i - 1); S.insert(i); for (int i = 0; i < n - 1; ++i) { if (S.size() < k - 1) { S.insert(i); } } std::cout << "TAK\n"; for (int x : S) std::cout << x + 1 << ' '; return 0; } } std::cout << "NIE"; 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 | #include <iostream> #include <vector> #include <map> #include <set> int n, k; std::vector<int> v; int main() { std::ios_base::sync_with_stdio(0); std::cin >> n >> k; v.resize(n); for (int i = 0; i < n; ++i) { std::cin >> v[i]; } bool inc = true; for (int i = 1; i < n; ++i) { if (v[i - 1] >= v[i]) { inc = false; break; } } if (inc) { std::cout << "NIE"; return 0; } if (k == 2) { std::multiset<int> A, B; for (int i = 1; i < n; ++i) { B.insert(v[i]); } A.insert(v[0]); for (int i = 1; i < n; ++i) { if (*A.begin() >= *B.rbegin()) { std::cout << "TAK\n"; std::cout << i; return 0; } A.insert(v[i]); B.erase(B.lower_bound(v[i])); } std::cout << "NIE"; return 0; } if (k == 3) { for (int i = 1; i < n - 1; ++i) { if (v[0] >= v[i] || v[i] >= v[n - 1]) { std::set<int> S; S.insert(i - 1); S.insert(i); std::cout << "TAK\n"; for (int x : S) std::cout << x + 1 << ' '; return 0; } } std::cout << "NIE"; return 0; } if (k >= 4) { for (int i = 1; i < n; ++i) { if (v[i] <= v[i - 1]) { std::set<int> S; if (i != 1) S.insert(i - 2); S.insert(i - 1); S.insert(i); for (int i = 0; i < n - 1; ++i) { if (S.size() < k - 1) { S.insert(i); } } std::cout << "TAK\n"; for (int x : S) std::cout << x + 1 << ' '; return 0; } } std::cout << "NIE"; return 0; } return 0; } |