计蒜客 41387.XKC's basketball team-线段树(区间查找大于等于x的最靠右的位置) (The Preliminary Contest for ICPC Asia Xuzhou 2019 E.) 2019年徐州网络赛

XKC's basketball team

XKC , the captain of the basketball team , is directing a train of nn team members. He makes all members stand in a row , and numbers them 1 \cdots n1⋯n from left to right.

The ability of the ii-th person is w_iwi​ , and if there is a guy whose ability is not less than w_i+mwi​+m stands on his right , he will become angry. It means that the jj-th person will make the ii-th person angry if j>ij>i and w_j \ge w_i+mwj​≥wi​+m.

We define the anger of the ii-th person as the number of people between him and the person , who makes him angry and the distance from him is the longest in those people. If there is no one who makes him angry , his anger is -1−1 .

Please calculate the anger of every team member .

Input

The first line contains two integers nn and m(2\leq n\leq 5*10^5, 0\leq m \leq 10^9)m(2≤n≤5∗105,0≤m≤109) .

The following  line contain nn integers w_1..w_n(0\leq w_i \leq 10^9)w1​..wn​(0≤wi​≤109) .

Output

A row of nn integers separated by spaces , representing the anger of every member .

样例输入复制

6 1
3 4 5 6 2 10

样例输出复制

4 3 2 1 0 -1

这道题目就是区间查找大于等于某个数的最靠右的位置。

线段树查询，大区间里找小区间。

两个版本的板子， 比赛的时候，l和r写反了，一直没过。。。

参考模板来源：

关于如何用线段树实现查找区间内第一个小于（大于）某一值x的方法

查询区间内第一个大于x的数

代码1：

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<bitset>
 #include<cassert>
 #include<cctype>
 #include<cmath>
 #include<cstdlib>
 #include<ctime>
 #include<deque>
 #include<iomanip>
 #include<list>
 #include<map>
 #include<queue>
 #include<set>
 #include<stack>
 #include<vector>
 using namespace std;
 typedef long long ll;

 const double PI=acos(-1.0);
 const double eps=1e-;
 const ll mod=1e9+;
 const int inf=0x3f3f3f3f;
 const int maxn=5e5+;
 const int maxm=+;
 #define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 #define lson l,m,rt<<1
 #define rson m+1,r,rt<<1|1

 ll tree[maxn<<];

 void pushup(int rt)
 {
     tree[rt]=max(tree[rt<<],tree[rt<<|]);
 }

 void update(int p,ll val,int l,int r,int rt)
 {
     if(l==r){
         tree[rt]=val;
         return ;
     }

     int m=(l+r)>>;
     if(p<=m) update(p,val,lson);
     else     update(p,val,rson);
     pushup(rt);
 }

 /*
 int get(ll val,int l,int r,int rt)
 {
     if(l==r){
         return l;
     }

     int m=(l+r)>>1;
     if(tree[rt<<1|1]>=val) return get(val,rson);
     if(tree[rt<<1]  > val) return get(val,lson);
 }
 */

 /*
 int query(int L,int R,ll val,int l,int r,int rt)
 {
     if(L>r||R<l){
         return -1;
     }
 //    if(l==r){
 //        if(tree[rt]>=val){
 //            return l;
 //        }
 //        else{
 //            return -1;
 //        }
 //    }
     if(L<=l&&r<=R){
         if(tree[rt]<val){
             return -1;
         }
         else{
             return get(val,l,r,rt);
         }
     }

     int m=(l+r)>>1;
     int ret=query(L,R,val,rson);
     if(ret!=-1){
         return ret;
     }
     return query(L,R,val,lson);
 }
 */

 int query(int L,int R,ll val,int l,int r,int rt)
 {
     if(L>r||R<l){
         return -;
     }
     if(l==r){
         if(tree[rt]>=val){
             return l;
         }
         else{
             return -;
         }
     }
     if(L<=l&&r<=R){
         if(tree[rt]<val){
             return -;
         }
 //        else{
 //            return get(val,l,r,rt);
 //        }
     }

     int m=(l+r)>>;
     int ret=query(L,R,val,rson);
     if(ret!=-){
         return ret;
     }
     return query(L,R,val,lson);
 }

 ll a[maxn];
 int ans[maxn];

 int main()
 {
     int n;
     ll m;
     scanf("%d%lld",&n,&m);
     for(int i=;i<=n;i++){
         scanf("%lld",&a[i]);
         update(i,a[i],,n,);
     }
     for(int i=;i<=n;i++){
         int pos=query(i,n,a[i]+m,,n,);
 //        cout<<pos<<endl;
         if(pos!=-) ans[i]=pos-i-;
         else ans[i]=-;
     }
     for(int i=;i<n;i++){
         printf("%d ",ans[i]);
     }
     printf("%d\n",ans[n]);
 }

代码2：

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<bitset>
 #include<cassert>
 #include<cctype>
 #include<cmath>
 #include<cstdlib>
 #include<ctime>
 #include<deque>
 #include<iomanip>
 #include<list>
 #include<map>
 #include<queue>
 #include<set>
 #include<stack>
 #include<vector>
 using namespace std;
 typedef long long ll;

 const double PI=acos(-1.0);
 const double eps=1e-;
 const ll mod=1e9+;
 const int inf=0x3f3f3f3f;
 const int maxn=5e5+;
 const int maxm=+;
 #define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 #define lson l,m,rt<<1
 #define rson m+1,r,rt<<1|1

 ll tree[maxn<<];

 void pushup(int rt)
 {
     tree[rt]=max(tree[rt<<],tree[rt<<|]);
 }

 void update(int p,ll val,int l,int r,int rt)
 {
     if(l==r){
         tree[rt]=val;
         return ;
     }

     int m=(l+r)>>;
     if(p<=m) update(p,val,lson);
     else     update(p,val,rson);
     pushup(rt);
 }

 int get(ll val,int l,int r,int rt)
 {
     if(l==r){
         return l;
     }

     int m=(l+r)>>;
     if(tree[rt<<|]>=val) return get(val,rson);
     if(tree[rt<<]  > val) return get(val,lson);
 }

 int query(int L,int R,ll val,int l,int r,int rt)
 {
     if(L>r||R<l){
         return -;
     }
 //    if(l==r){
 //        if(tree[rt]>=val){
 //            return l;
 //        }
 //        else{
 //            return -1;
 //        }
 //    }
     if(L<=l&&r<=R){
         if(tree[rt]<val){
             return -;
         }
         else{
             return get(val,l,r,rt);
         }
     }

     int m=(l+r)>>;
     int ret=query(L,R,val,rson);
     if(ret!=-){
         return ret;
     }
     return query(L,R,val,lson);
 }

 ll a[maxn];
 int ans[maxn];

 int main()
 {
     int n;
     ll m;
     scanf("%d%lld",&n,&m);
     for(int i=;i<=n;i++){
         scanf("%lld",&a[i]);
         update(i,a[i],,n,);
     }
     for(int i=;i<=n;i++){
         int pos=query(i,n,a[i]+m,,n,);
 //        cout<<pos<<endl;
         if(pos!=-) ans[i]=pos-i-;
         else ans[i]=-;
     }
     for(int i=;i<n;i++){
         printf("%d ",ans[i]);
     }
     printf("%d\n",ans[n]);
 }