线段树高级数据结构实现

#include <fstream>                 //点更新
#include <iostream>
#include <cstdio>

using namespace std;

const int N=10000;
int n,m,a[N];
struct node
{
    int left,right;
    int max_,sum_;
}tree[4*N];

void build(int id,int l,int r);//建一棵线段树
int query_sum(int id,int l,int r);//查询区间和
int query_max(int id,int l,int r);//查询区间最大值
void update(int id,int pos,int val);//更新位置pos的值增加val

int main()
{
    //freopen("D:\\input.in","r",stdin);
    //freopen("D:\\output.out","w",stdout);
    int bo,t1,t2;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    build(1,1,n);
    for(int i=1;i<=m;i++)
    {