Assignment

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 557 Accepted Submission(s): 280

Problem Description Tom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. Now, Tom is going to assign a special task to some staffs who were in the same group. In a group, the difference of the ability of any two staff is less than k, and their numbers are continuous. Tom want to know the number of groups like this.
Input In the first line a number T indicates the number of test cases. Then for each case the first line contain 2 numbers n, k (1<=n<=100000, 0 Output For each test，output the number of groups.
Sample Input

2
4 2
3 1 2 4
10 5
0 3 4 5 2 1 6 7 8 9

Sample Output

5
28
HintFirst Sample, the satisfied groups include:[1,1]、[2,2]、[3,3]、[4,4] 、[2,3]

Author FZUACM
Source 2015 Multi-University Training Contest 1
Recommend We have carefully selected several similar problems for you: 5299 5298 5297 5296 5295

rmq+二分

#include
   
    
#include
    
      #include
     
       #include
      
        #include
       
         #include
        
          #include
         
           #include
          
            #include
           
             #include
             #define L(x) (x<<1) #define R(x) (x<<1|1) #define MID(x,y) ((x+y)>>1) #define eps 1e-8 typedef __int64 ll; const int mod=1e9+7; using namespace std; #define N 100007 int a[N],n; int dpmin[N][25],dpmax[N][25]; int k; inline bool judge(int le,int ri) { int kk=log2((ri-le+1)*1.0); int mi=min(dpmin[le][kk],dpmin[ri-(1<
             
              >1; if(judge(i,mid)) { p=mid; le=mid+1; } else ri=mid-1; } ans+=p-i+1; } printf(%I64d ,ans); } return 0; }

单调队列

#include
   
    
#include
    
      #include
     
       #include
      
        #include
       
         #include
        
          #include
         
           #include
          
            #include
           
             #include
             #define L(x) (x<<1) #define R(x) (x<<1|1) #define MID(x,y) ((x+y)>>1) #define eps 1e-8 using namespace std; const int mod=1e9+7; #define INF 0x3f3f3f3f const int N=100005; int mique[N],maque[N],mihead,mahead,mitail,matail; int n,a[N],k; int pre,now; __int64 ans; inline void miinque(int i) { while(mihead
             
              a[maque[matail-1]]) matail--; maque[matail++]=i; } void outque(int pos) { if(a[maque[mahead]]-a[mique[mihead]]>=k) { int nowlen=pos-now-1; int prelen=pre-now; ans+=(__int64)(nowlen+1)*nowlen/2; if(prelen>=1) ans-=(__int64)(prelen+1)*prelen/2; pre=pos-1; } while(a[maque[mahead]]-a[mique[mihead]]>=k) if(mique[mihead]
              
               =1) ans-=(__int64)(prelen+1)*(prelen)/2; pre=n-1; } printf(%I64d ,ans+n); } return 0; }


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：Codeforces Amr and Chemistry（..	下一篇：Codeforces Round #313 A. Curren..

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: