多校1 Assignment(枚举 二分 rmq) 1002

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

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<k<=10^9),indicate the company has n persons, k means the maximum difference between abilities of staff in a group is less than k. The second line contains n integers:a[1],a[2],…,a[n](0<=a[i]<=10^9),indicate the i-th staff’s ability.

 

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

Hint

First 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 

哈哈

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;

int n,k;
int a[100005];
int ma[100005][30],mi[100005][30];

void inrmq()
{
    int i,j;
    for(j=1;(1<<j)<=n;j++)
    {
        for(i=1;i+(1<<j)-1<=n;i++)
        {
            ma[i][j]=max(ma[i][j-1],ma[i+(1<<(j-1))][j-1]);
            mi[i][j]=min(mi[i][j-1],mi[i+(1<<(j-1))][j-1]);
        }
    }
    return ;
}

int rmqjudge(int l,int r)
{
    int kk=(int)(log(r-l+1.0)/log(2.0));
    return (max(ma[l][kk],ma[r-(1<<kk)+1][kk])-min(mi[l][kk],mi[r-(1<<kk)+1][kk]))<k;
}

int main()
{
    int T;
    int i,j;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d",&n,&k);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            ma[i][0]=a[i];
            mi[i][0]=a[i];
        }
        inrmq();
        long long ans=0;
        int l,r,p,mid;
        for(i=1;i<=n;i++)
        {
            l=i;
            r=n;
            while(l<=r)
            {
                mid=(l+r)>>1;
                if(rmqjudge(i,mid))
                {
                    p=mid;
                    l=mid+1;
                }
                else
                    r=mid-1;
            }
            ans=ans+p-i+1;
        }
        printf("%I64d
",ans);
    }
    return 0;
}