线段树，（segement tree）

#include <stdlib.h>
#include <iostream>

#define MAX_LEN 1000

void build_tree(int arr[], int tree[], int node, int start, int end)
{
   
	if (start == end)
	{
   
		tree[node] = arr[start];
	}
	else {
   
		int mid = (start + end) / 2;
		int left_node = 2 * node + 1;
		int right_node = 2 * node + 2;

		build_tree(arr, tree, left_node, start, mid);
		build_tree(arr, tree,