线段树的基本题。询问给定区间内最大值与最小值的差。分别建个最大堆和最小堆即可。#include<stdio.h>#include<string.h>#include<iostream>#define MAXD 1000001using namespace std;int N,Q,maxt[2*MAXD],mint[2*MAXD],a[MAXD],D;int great(int a,int b){ return a>b?a:b;}int small(int a,int b){ return a<b?a:b;}int Qmax(int x,int y Read More
