bzoj3314

分析：一眼单调队列。

#include<cstdio>
#include<cstring>
#include<algorithm>
//#include<cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;
const int N=3e5+5;
int n,m;
struct node
{
    int x,h;
}a[N],q[N];
bool cmp(node a,node b)
{
    return a.x<b.x;
}
bool bz1[N],bz2[N];
int main()
{
    scanf("%d%d",&n,&m);
    fo(i,1,n)scanf("%d%d",&a[i].x,&a[i].h);
    sort(a+1,a+1+n,cmp);
    int l=1,r=0;
    fo(i,1,n)
    {
        while (l<=r&&q[r].h<a[i].h)r--;
        q[++r]=a[i];
        while (l<=r&&q[l].x<a[i].x-m)l++;
        if (q[l].h>=2*a[i].h)bz1[i]=1;
    }
    l=1,r=0;
    fd(i,n,1)
    {
        while (l<=r&&q[r].h<a[i].h)r--;
        q[++r]=a[i];
        while (l<=r&&q[l].x>a[i].x+m)l++;
        if (q[l].h>=2*a[i].h)bz2[i]=1;
    }
    int ans=0;
    fo(i,1,n)
    if(bz1[i]&&bz2[i])ans++;
    printf("%d\n",ans);
    return 0;
}