POJ-3264-Balanced Lineup-线段树模板题-查询区间内最大值和最小值之差

For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguous range of cows from the milking lineup to play the game. However, for all the cows to have fun they should not differ too much in height.

Farmer John has made a list of Q ( ≤ Q ≤ ,) potential groups of cows and their heights ( ≤ height ≤ ,,). For each group, he wants your help to determine the difference in height between the shortest and the tallest cow in the group.

input

Line : Two space-separated integers, N and Q.
Lines .. N+: Line i+ contains a single integer that is the height of cow i
Lines N+.. N+ Q+: Two integers A and B ( ≤ A ≤ B ≤ N), representing the range of cows from A to B inclusive.

output

Lines .. Q: Each line contains a single integer that is a response to a reply and indicates the difference in height between the tallest and shortest cow in the range.

Sample Input

Sample output

题意：

给出n和q，给出n头奶牛的身高，q次询问，每次询问给出区间a、b，求出区间内的最大值和最小值之差

这里注意一下给出的样例：（解释一下输出）

给出的样例为1、7、3、4、2、5，表示区间1、2、3、4、5、6

思路：

线段树的模板题，求出区间内的最大值和最小值之差也就是查询已经建立好的线段树的最大值和最小值之差

 #include<stdio.h>
 #include<iostream>
 #include<algorithm>
 #include<string.h>
 #include<cmath>
 #include<queue>
 #include<stdlib.h>
 typedef long long ll;
 using namespace std;
 const int N=;

 //需要开到四倍空间
 int a[*N];//max
 int b[*N];//min

 //每个父节点记录的是它下面的两个节点的最大值
 void build(int L,int R,int i)
 {
     if(L==R)
     {
         scanf("%d",&a[i]);
         b[i]=a[i];
         return;
     }
     int mid=(L+R)>>;
     build(L,mid,i<<);
     build(mid+,R,i<<|);
     a[i]=max(a[i<<],a[i<<|]);
     b[i]=min(b[i<<],b[i<<|]);
     //pushup(i)////每次传的时候把根节点也往下去寻找最大值
     ////比较其左右两个节点的大小，取最大值
     //看题目给的需要求什么
 }

 //query(aa,bb,1,n,1)
 int querymax(int left,int right,int L,int R,int i)//a求区间最小值
 {
     if(left<=L&&right>=R)
         return a[i];
     int mid=(L+R)>>;
     int ans=-;
     if(left<=mid)
         ans=max(ans,querymax(left,right,L,mid,i<<));
     // else
     if(right>mid)
         ans=max(ans,querymax(left,right,mid+,R,i<<|));
     return ans;
 }

 //query(aa,bb,1,n,1)
 int querymin(int left,int right,int L,int R,int i)//b求区间最大值
 {
     if(left<=L&&R<=right)
         return b[i];
     int mid=(L+R)>>;
     int ans=0x3f3f3f3f;
     if(left<=mid)
         ans=min(ans,querymin(left,right,L,mid,i<<));
     // else
     if(right>mid)
         ans=min(ans,querymin(left,right,mid+,R,i<<|));
     return ans;
 }

 int main()
 {
     int n,m;
     while(~scanf("%d %d",&n,&m))
     {
    //     memset(a,0,sizeof(a));
         build(,n,);//传入最左端点，最右端点，根节点进行建树
         //建树的过程中输入每一个节点
         for(int i=; i<m; i++)
         {
             int aa,bb;
             scanf("%d %d",&aa,&bb);
             int kk=querymax(aa,bb,,n,)-querymin(aa,bb,,n,);
             printf("%d\n",kk);
         }
     }
     return ;
 }

树状数组：

这个代码思路看注释的话好理解，但是代码不好理解

 #include<stdio.h>
 #include<iostream>
 #include<string.h>
 using namespace std;

 int a[],maxx[],minn[];

 int lowbit(int x)
 {
     return x&(-x);
 }

 int w(int L,int R)
 {
     int min1=a[R];
     int max1=a[R];
     while(L!=R)
     {
         for(R--; R-lowbit(R)>=L; R=R-lowbit(R))
         {
             min1=min(min1,minn[R]);
             max1=max(max1,maxx[R]);
         }
         max1=max(max1,a[R]);
         min1=min(min1,a[R]);

     }
     return max1-min1;

 }

 int main()
 {
     std::ios::sync_with_stdio(false);
     int n,q;
     cin>>n>>q;
     for(int i=; i<=n; i++)
     {
         cin>>a[i];
 //        update(i,a[i]);
         maxx[i]=minn[i]=a[i];
         for(int j=; j<lowbit(i); j*=)
         {
             maxx[i]=max(maxx[i],maxx[i-j]);
             minn[i]=min(minn[i],minn[i-j]);
         }
     }
     for(int i=; i<q; i++)
     {
         int aa,bb;
         cin>>aa>>bb;
         cout<<w(aa,bb)<<endl;
     }
     return ;
 }

这个代码也A了，可以参考这个，类似树状数组的原模板，好理解，细节上变动一点就可以了