AcWing 3537. 树查找
原题链接
简单
作者:
Yeahhh
,
2021-05-20 15:06:57
,
所有人可见
,
阅读 390
import java.util.Scanner;
/**
* @author: yeah
* 根据第i层有 2^(i-1)个数进行模拟即可 i从1开始
*/
public class Main {
static int n;
static int[] t;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
n = in.nextInt();
t = new int[n + 1];
for (int i = 1; i <= n; i++) {
t[i] = in.nextInt();
}
int k = in.nextInt();
int idx = 1;
for (int i = 1; i <= n; ) {
if (idx == k) {
for (int j = i; j <= i + Math.pow(2, idx - 1) - 1 && j <= n; j++) {
System.out.print(t[j] + " ");
}
return;
}
i += Math.pow(2, idx - 1);
idx++;
}
System.out.println("EMPTY");
}
}