发现自己还不是很懂单调队列这一套理论啊
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=50005;
int n,a[N],K;
int Q1[N],l1,r1;
int Q2[N],l2,r2;
int main(){
long long ans=0;
read(n); read(K); for (int i=1;i<=n;i++) read(a[i]);
int j=1; l2=l1=r2=r1=-1;
for (int i=1;i<=n;i++){
while (j<=n){
while (l1<r1 && a[j]>=a[Q1[r1]]) r1--;
Q1[++r1]=j;
while (l2<r2 && a[j]<=a[Q2[r2]]) r2--;
Q2[++r2]=j;
if (a[Q1[l1+1]]-a[Q2[l2+1]]<=K) j++; else break;
}
ans+=j-i;
if (Q1[l1+1]==i) l1++;
if (Q2[l2+1]==i) l2++;
}
printf("%lld\n",ans);
}