#include<bits/stdc++.h>
using namespace std;
long long T[500006];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,k,i,amax=0,ind;
cin >> n >> k;
for(i=1;i<=n;i++)
{
cin >> T[i];
if(T[i]>amax)
{
amax=T[i]; ind=i;
}
}
if(k==2)
{
if(ind==1)
{
cout << "TAK" << endl << 1;
}
else
{
cout << "NIE" << endl;
}
}
else
{
if(ind==n)
{
cout << "NIE" << endl;
}
else
{
cout << "TAK" << endl;
k-=1;
for(i=1;i<ind-1;i++)
{
if(k==2) break;
cout << i << " ";
k--;
}
cout << ind-1 << " " << ind << " "; k-=2; i=ind+1;
while(k)
{
cout << i << " "; i++; k--;
}
}
}
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 | #include<bits/stdc++.h> using namespace std; long long T[500006]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n,k,i,amax=0,ind; cin >> n >> k; for(i=1;i<=n;i++) { cin >> T[i]; if(T[i]>amax) { amax=T[i]; ind=i; } } if(k==2) { if(ind==1) { cout << "TAK" << endl << 1; } else { cout << "NIE" << endl; } } else { if(ind==n) { cout << "NIE" << endl; } else { cout << "TAK" << endl; k-=1; for(i=1;i<ind-1;i++) { if(k==2) break; cout << i << " "; k--; } cout << ind-1 << " " << ind << " "; k-=2; i=ind+1; while(k) { cout << i << " "; i++; k--; } } } return 0; } |
English