【线段树】2015 Multi-University Training Contest 1 1002

题目大意就是问有多少个区间使得区间最大值最小值之差小于K。

只要建立一个队列，然后枚举当前右端点，先向队列中加入右端点。然后再判断当前区间可不可以，如果不合法然后就队首出队。每次加上区间长度就行。最后答案可能爆int...

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
struct rec
{
       int l,r,minf,maxf,lch,rch;
}tree[400100];
int n,k,a[200100],tot;
void maketree(int l,int r)
{
     int now=++tot;
     tree[now].l=l;
     tree[now].r=r;
     if (l==r) return ;
     int mid=(l+r)>>1;
     tree[now].lch=tot+1;maketree(l,mid);
     tree[now].rch=tot+1,maketree(mid+1,r);
}
void insert(int x,int l,int r,int w)
{
     if (tree[x].l>=l&&tree[x].r<=r) 
     {
        tree[x].minf=w;
        tree[x].maxf=w;
        return ;
     }
     int mid=(tree[x].l+tree[x].r)>>1;
     if (l<=mid) insert(tree[x].lch,l,r,w);
     if (r>mid) insert(tree[x].rch,l,r,w);
     tree[x].minf=min(tree[tree[x].lch].minf,tree[tree[x].rch].minf);
     tree[x].maxf=max(tree[tree[x].lch].maxf,tree[tree[x].rch].maxf);
}
int getmin(int x,int l,int r)
{
    int now=2000000000;
    if (tree[x].l>=l&&tree[x].r<=r) return tree[x].minf;
    int mid=(tree[x].l+tree[x].r)>>1;
    if (l<=mid) now=min(now,getmin(tree[x].lch,l,r));
    if (r>mid) now=min(now,getmin(tree[x].rch,l,r));
    return now;
}
int getmax(int x,int l,int r)
{
    int now=0;
    if (tree[x].l>=l&&tree[x].r<=r) return tree[x].maxf;
    int mid=(tree[x].l+tree[x].r)>>1;
    if (l<=mid) now=max(now,getmax(tree[x].lch,l,r));
    if (r>mid) now=max(now,getmax(tree[x].rch,l,r));
    return now;
}
int main()
{
    int t,l,r,mid;
    long long sum;
    scanf("%d",&t);
    while (t--)
    {
          memset(tree,0,sizeof(tree));
          sum=0,tot=0;
          scanf("%d%d",&n,&k);
          maketree(1,n);
          for (int i=1;i<=n;i++)
          {
              scanf("%d",&a[i]);
              insert(1,i,i,a[i]);
          }
          int head=1,tail=0;
          for (int i=1;i<=n;i++)
          {
				while (getmax(1,head,i)-getmin(1,head,i)>=k) head++;
				sum+=i-head+1;
		  }
          cout<<sum<<endl;
    }
    return 0;
}