#include <cstdio>
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int maxsum[22][50005];
int minsum[22][50005];
void rmq(int num)
{
for(int j=1;j<21;j++)
for(int i=1;i<=num;i++)
if(i+(1<<j)-1 <= num)
{
maxsum[j][i] = max(maxsum[j - 1][i], maxsum[j - 1][i + (1 << (j - 1))]);
minsum[j][i] = min(minsum[j - 1][i], minsum[j - 1][i + (1 << (j - 1))]);
}
}
int main()
{
int n,q;
scanf("%d %d", &n, &q);
for(int i=1;i<=n;i++) scanf("%d", &maxsum[0][i]);
for(int i=1;i<=n;i++)
{
minsum[0][i] = maxsum[0][i];
}
rmq(n);
for(int i=0;i<q;i++)
{
int l,r;
scanf("%d %d", &l, &r);
int k = (int)(log(r-l+1.0)/log(2.0));
int mx = max(maxsum[k][l],maxsum[k][r-(1<<k)+1]);
int mi = min(minsum[k][l],minsum[k][r-(1<<k)+1]);
printf("%d\n", mx-mi);
}
return 0;
}
注意:
1.括号的存在(找了好久)
2.cin比scanf耗时更久