poj3264题解

线段树入门题
在分支的时候没把握好，出来了奇奇怪怪的答案，再加忘了初始化，，，

#include <stdio.h>
#include <string.h>
#define MAx(X,Y) ((X)>(Y)?(X):(Y))
#define MIn(X,Y) ((X)<(Y)?(X):(Y))
int N,minnn,maxxx;
struct _tag
{
    int tmax,tmin;
}tree[150001];
void build(int tn,int left,int right)
{
    int mid,tmp;
    if(left==right){
        scanf("%d",&tmp);
        tree[tn].tmax=tree[tn].tmin=tmp;return;
    }
    mid=(left+right)>>1;
    build(tn<<1,left,mid);
    build(tn<<1|1,mid+1,right);
    tree[tn].tmax=MAx(tree[tn<<1].tmax,tree[tn<<1|1].tmax);
    tree[tn].tmin=MIn(tree[tn<<1].tmin,tree[tn<<1|1].tmin);
}
void find(int tn,int left,int right,int x,int y)
{
    int mid;
    if(x<=left&&y>=right) { minnn=MIn(minnn,tree[tn].tmin);
        maxxx=MAx(maxxx,tree[tn].tmax);return;}
    mid=(left+right)>>1;
    if(y<=mid) find(tn<<1,left,mid,x,y);
    else if(x>mid) find(tn<<1|1,mid+1,right,x,y);
    else {find(tn<<1,left,mid,x,mid);find(tn<<1|1,mid+1,right,mid+1,y);}
}
int main(int argc, char const *argv[])
{
    int a,b,Q,i;
    for(i=1;i<N;i++)
        {   tree[i].tmax=0;tree[i].tmin=20000000;}
        //忘了初始化wa死你
    scanf("%d %d",&N,&Q);
    build(1,1,N);
    while(Q--)
    {
        minnn=20000000;maxxx=0;
        scanf("%d %d",&a,&b);
        find(1,1,N,a,b);
        printf("%d\n",maxxx-minnn );
    }
    return 0;
}