当前位置：网站首页>3537. Tree lookup

3537. Tree lookup

2022-07-22 02:09:00 【Ray. C.L】

Insert picture description here

Ideas ： $The first k The starting point of the layer is 2^{k-1}-1 The length of this layer is 2^{k-1} ,$ This is the property of a complete binary tree

~~The difficulty of these machine test questions is really beyond words~~

Code ：

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 1010;
int n, k;
int w[N];

int main()
{
    
    
    int n, k;
    cin >> n;
    for(int i = 0; i < n; i ++) cin  >> w[i];
    cin >> k;
    int s = (1 << k - 1) - 1, e = s + (1 << k - 1);
    
    for(int i = s; i < e && i < n; i ++)
        cout << w[i] << ' ';
        
    if(s >= n) 
        cout << "EMPTY" << endl;
    return 0;
}