시나브로

#include int tree[3000]; int each_depth[12][1025]; int each_depth_index[12]; int max_depth = 0; int squeared_2[11] = { 0 }; void seach_depth(int start, int end, int depth) { if (depth > max_depth) return; int box = (end-start) / 2; each_depth[depth][each_depth_index[depth]++] = tree[start + box]; seach_depth(start, start + box - 1, depth + 1); seach_depth(start + box+1, end, depth + 1); } int ma..