hdu 5289 单调队列

题意： 。。。

思路：单调队列 rmq + 二分

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define fi first
#define se second
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=3221225473;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
#define Fast_IO ios_base::sync_with_stdio(0);cin.tie(0)
int T;
int n,k;
int a[100010];
deque<int> qmax;
deque<int> qmin;
int main()
{
    cin>>T;
    while(T--)
    {
        while(!qmax.empty()) qmax.pop_front();
        while(!qmin.empty()) qmin.pop_front();
        cin>>n>>k;
        rep(i, 1, n)
            scanf("%d", &a[i]);
        int now = 1;
        ll res = 0;
        rep(i, 1, n)
        {
            while(!qmax.empty()&&a[qmax.back()] <= a[i]) qmax.pop_back();
            while(!qmin.empty()&&a[qmin.back()] >= a[i]) qmin.pop_back();
            qmax.push_back(i); qmin.push_back(i);
            while(a[qmax.front()] - a[qmin.front()] >=k) 
            {
                if(qmax.front() > qmin.front()) 
                    now = qmin.front()+1, qmin.pop_front();
                else now = qmax.front()+1, qmax.pop_front();
            }
            res += i-now+1;
        }
        cout<<res<<endl;
    }
    return 0;
}