[백준 9934] 완전 이진 트리

문제링크

#include <iostream>
#include <vector>

std::vector<int> vector[10] = { };
int arr[1024];

void f(int depth, int start, int end)
{
    if (start >= end)
    {
        return;
    }

    int mid = (start + end) / 2;
    vector[depth].push_back(arr[mid]);

    f(depth + 1, start, mid);
    f(depth + 1, mid + 1, end);
}

int main()
{
    int k = 0;

    std::cin >> k;
    ++k;

    int i = 0;

    for (; i < k; ++i)
    {
        std::cin >> arr[i];
    }

    f(0, 0, i);

    for (int i = 0; i < k; ++i)
    {
        for (auto v : vector[i])
        {
            std::cout << v << ' ';
        }

        std::cout << '\n';
    }
}