初赛第六场C

题意：B的数据加强版

思路：RMQ

#include<bits/stdc++.h>
using namespace std;

int a[200005];
int d[200005][20];
struct node{
    int x,y;
}b[2005];
bool cmp(node p,node q){
    return p.x<q.x;
}
int RMQ(int l,int r){
    int k=0;
    while((1<<(k+1))<=r-l+1)
        k++;
    return min(d[l][k],d[r-(1<<k)+1][k]);
}
int main(){
    int n,kk;
    scanf("%d%d",&n,&kk);
    memset(d,127,sizeof(d));
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
        d[i][0]=a[i];
    }
    for(int j=1;(1<<j)<=n;j++)
    for(int i=0;i+(1<<j)-1<n;i++){
        d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
    }
    int m;
    scanf("%d",&m);
    for(int i=1;i<=m;i++){
        scanf("%d%d",&b[i].x,&b[i].y);
    }
    int xx,yy;
    int sum;
    int ssum=0;
    sort(b+1,b+1+m,cmp);
    for(int i=1;i<=m;i++){
        for(int j=i+1;j<=m;j++){
            sum=0;
            yy=b[i].y;
            yy=RMQ(b[i].x,b[j].x-1);
            sum+=b[j].x-b[i].x;
            sum+=b[i].y-yy;
            sum+=abs(yy-b[j].y);
            if(sum<=kk) ssum++;
        }
    }

    cout<<ssum<<endl;
}