2019 徐州icpc网络赛 E. XKC's basketball team

#include<bits/stdc++.h>
using namespace std;
#define maxn 1000005
#define mod 1000000007
int a[maxn];
struct node
{
    int l,r,ma;
}tree[maxn*4];
void build(int l,int r,int p)
{
    tree[p].l = l;
    tree[p].r = r;
    tree[p].ma = -1;
    if(l == r)
    {
        tree[p].ma = a[l];
        return;
    }
    int mid = (l+r)/2;
    build(l,mid,p*2);
    build(mid+1,r,p*2+1);
    tree[p].ma = max(tree[p*2].ma,tree[p*2+1].ma);
}
int query(int x,int y,int p)
{
    if(x == tree[p].l && y == tree[p].r)
        return tree[p].ma;
    int mid = (tree[p].l + tree[p].r)/2;
    if(x > mid)
        return query(x,y,p*2+1);
    else if(y <= mid)
        return query(x,y,p*2);
    else
        return max(query(x,mid,p*2),query(mid+1,y,p*2+1));
 
}
int main()
{
    int T,i,j,k,n,q,x,y,m,s,l,r,mid;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
        scanf("%d",&a[i]);
    build(1,n,1);
    for(i=1;i<n;i++)
    {
        s=m+a[i];
        l=i+1;
        r=n;
        while(l<r)
        {
              mid=(l+r+1)/2;
             if(query(mid,r,1)>=s)
            {
                l=mid;
             }
             else if(query(l,mid,1)>=s)
             {
                 r=mid-1;
             }
             else 
             {
                  break;
             }
        }
        if(a[l]>=s)
        cout<<l-i-1<<‘ ‘;
        else
        cout<<"-1"<<‘ ‘;
    }
    cout<<"-1"<<endl;
    return 0;
}