#include <bits/stdc++.h> using namespace std; #define st first #define nd second const int INF = 5e5 + 7; long long n, k, t[INF], ind, maxx, imin, imax, minx = 1e9 + 7; int main(){ cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); cin >> n >> k; for(int i = 1; i <= n; i++){ cin >> t[i]; if(maxx < t[i]){ maxx = t[i]; imax = i; } if(minx >= t[i]){ minx = t[i]; imin = i; } } if(k == 2){ if(imin == n){ cout << "TAK" << '\n' << n - 1; } else if(imax == 1){ cout << "TAK" << '\n' << 1; } else cout << "NIE"; return 0; } else if(k == 3){ if(imin != 1){ cout << "TAK" << '\n'; if(imin == n){ cout << 1 << " " << n - 1; } else{ cout << imin - 1 << " " << imin; } } else if(imax != n){ cout << "TAK" << '\n'; if(imax == 1){ cout << 1 << " " << 2; } else{ cout << imax - 1 << " " << imax; } } else{ cout << "NIE"; return 0; } } else if(k >= 4){ /*if(imax < n){ } else if(imin > 1){ } else*/ for(int i = 2; i <= n; i++){ if(t[i] <= t[i - 1]){ ind = i; break; } } if(ind != 0){ cout << "TAK" << '\n'; int licz = k - 1; if(ind == n){ for(int i = 1; i < n; i++){ if(licz > 2){ licz--; cout << i << " "; } } cout << ind - 2 << " " << ind - 1; } else if(ind == 2){ cout << 1 << " " << 2 << " "; for(int i = 3; i <= n; i++){ if(licz > 2){ cout << i << " "; licz--; } } } else{ for(int i = 1; i <= n; i++){ if(ind - 2 == i){ cout << ind - 2 << " " << ind - 1 << " " << ind << " "; i += 3; } if(licz > 3){ cout << i << " "; licz--; } } } } else{ cout << "NIE"; return 0; } } else cout << "NIE"; }
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 | #include <bits/stdc++.h> using namespace std; #define st first #define nd second const int INF = 5e5 + 7; long long n, k, t[INF], ind, maxx, imin, imax, minx = 1e9 + 7; int main(){ cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); cin >> n >> k; for(int i = 1; i <= n; i++){ cin >> t[i]; if(maxx < t[i]){ maxx = t[i]; imax = i; } if(minx >= t[i]){ minx = t[i]; imin = i; } } if(k == 2){ if(imin == n){ cout << "TAK" << '\n' << n - 1; } else if(imax == 1){ cout << "TAK" << '\n' << 1; } else cout << "NIE"; return 0; } else if(k == 3){ if(imin != 1){ cout << "TAK" << '\n'; if(imin == n){ cout << 1 << " " << n - 1; } else{ cout << imin - 1 << " " << imin; } } else if(imax != n){ cout << "TAK" << '\n'; if(imax == 1){ cout << 1 << " " << 2; } else{ cout << imax - 1 << " " << imax; } } else{ cout << "NIE"; return 0; } } else if(k >= 4){ /*if(imax < n){ } else if(imin > 1){ } else*/ for(int i = 2; i <= n; i++){ if(t[i] <= t[i - 1]){ ind = i; break; } } if(ind != 0){ cout << "TAK" << '\n'; int licz = k - 1; if(ind == n){ for(int i = 1; i < n; i++){ if(licz > 2){ licz--; cout << i << " "; } } cout << ind - 2 << " " << ind - 1; } else if(ind == 2){ cout << 1 << " " << 2 << " "; for(int i = 3; i <= n; i++){ if(licz > 2){ cout << i << " "; licz--; } } } else{ for(int i = 1; i <= n; i++){ if(ind - 2 == i){ cout << ind - 2 << " " << ind - 1 << " " << ind << " "; i += 3; } if(licz > 3){ cout << i << " "; licz--; } } } } else{ cout << "NIE"; return 0; } } else cout << "NIE"; } |