Kanade has an array a[1..n] , she define that an array b[1..m] is good if and only if it satisfy the following conditions:
1<=b[i]<=n
b[i]<b[i+1] for every i between 1 and m-1
a[b[i]] < a[b[i+1]] for every i between 1 and m-1
m>0
Now you need to find the k-th smallest lexicographically good array.
The first line has two integer n,k
The second line has n integer a[i]
If there is no solution, just only output -1, else output two lines, the first line has an integer m, the second line has m integer b[i]
3 2 1 2 3
2 1 2
3 1000000000 1 2 3
-1
1<=n <= 5*10^5
1<=k<=10^(18)
1<=a[i]<=10^9
这道题你会答吗？花几分钟告诉大家答案吧！
扫描二维码，关注牛客网
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
京公网安备
11010502036488号
