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 (1 ≤ Q ≤ 200,000) potential groups of cows and their heights (1 ≤ height ≤ 1,000,000). For each group, he wants your help to determine the difference in height between the shortest and the tallest cow in the group.

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

Lines 1..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.

6

3

0

 1 #include<iostream>

 #include<cstdio>

 #define l(u) (u<<1)

 #define r(u) (u<<1|1)

 using namespace std;

 int n,q,highest,lowest;

 int cow[];

 struct pp{

     int l,r,mins,maxs;

 };

 pp node[];

 int min(int a,int b)

 {

     return a<b?a:b;

 }

 int max(int a,int b)

 {

     return a>b?a:b;

 }

 void build(int u,int left,int right)

 {

     node[u].l=left;node[u].r=right;

     if (node[u].l==node[u].r)

     {

         node[u].mins=cow[left];

         node[u].maxs=cow[left];

         return ;

     }

     int mid=(left+right)>>;

     build(l(u),left,mid);

     build(r(u),mid+,right);

     node[u].mins=min(node[l(u)].mins,node[r(u)].mins);

     node[u].maxs=max(node[l(u)].maxs,node[r(u)].maxs);

 }

 int query(int u,int left,int right)

 {

     if (node[u].l==left&&node[u].r==right)

     {

         return node[u].maxs-node[u].mins;

     }

     int mid=(node[u].l+node[u].r)>>;

     if (right<=mid)  query(l(u),left,right);

     else if (left>mid)  query(r(u),left,right);

     else

     {

         query(l(u),left,mid);

         query(r(u),mid+,right);

     }

 }

 int main()

 {

     freopen("balance.in","r",stdin);

     cin>>n>>q;

     for(int i=;i<=n;i++)

       scanf("%d",&cow[i]);

     build(,,n);

     for(int i=;i<=q;i++)

     {

         int a,b;

         //highest=0;//***

         //lowest=1234567;//***

         scanf("%d%d",&a,&b);

         printf("%d\n",query(,a,b));

     }

     return ;

 }

 #include<iostream>

 #include<cstdio>

 #define l(u) (u<<1)

 #define r(u) (u<<1|1)

 using namespace std;

 int n,q,highest,lowest;

 int cow[];

 struct pp{

     int l,r,mins,maxs;

 };

 pp node[];

 int min(int a,int b)

 {

     return a<b?a:b;

 }

 int max(int a,int b)

 {

     return a>b?a:b;

 }

 void build(int u,int left,int right)

 {

     node[u].l=left;node[u].r=right;

     if (node[u].l==node[u].r)

     {

         node[u].mins=cow[left];

         node[u].maxs=cow[left];

         return ;

     }

     int mid=(left+right)>>;

     build(l(u),left,mid);

     build(r(u),mid+,right);

     node[u].mins=min(node[l(u)].mins,node[r(u)].mins);

     node[u].maxs=max(node[l(u)].maxs,node[r(u)].maxs);

 }

 void query(int u,int left,int right)

 {

     if (node[u].l==left&&node[u].r==right)

     {

         lowest=min(lowest,node[u].mins);//***

         highest=max(highest,node[u].maxs);///***

         return ;

     }

     int mid=(node[u].l+node[u].r)>>;

     if (right<=mid)  query(l(u),left,right);

     else if (left>mid)  query(r(u),left,right);

     else

     {

         query(l(u),left,mid);

         query(r(u),mid+,right);

     }

 }

 int main()

 {

     //freopen("balance.in","r",stdin);

     cin>>n>>q;

     for(int i=;i<=n;i++)

       scanf("%d",&cow[i]);

     build(,,n);

     for(int i=;i<=q;i++)

     {

         int a,b;

         highest=;//***

         lowest=;//***

         scanf("%d%d",&a,&b);

         query(,a,b);

         printf("%d\n",highest-lowest);

     }

     return ;

 }