HDU5289(Assignment)

Assignment

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],…,an,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]

思路

静态序列的区间最大最小值，可以用单调队列维护，RMQ + 二分，线段树 + 二分。但是我用线段树 + 二分枚举右端点TLE死死的，但是线段树 + 暴力枚举右端点却能过去。我也是没看懂调了一上午没发现错误在哪，按道理来说二分枚举右端点应该比枚举还要快啊。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <deque>
using namespace std;
#define lson k<<1,l,m
#define rson k<<1|1,m+1,r
#define ll long long
const int maxn = 1e6+5;
const int inf = 1e9+1e5;
#define ll long long
int a[maxn],smin[maxn<<2],smax[maxn<<2];
inline void build(int k,int l,int r)
{
	if(l == r){
		smax[k] = smin[k] = a[l];
		return ;
	}
	int m = (l + r) >> 1;
	build(lson);
	build(rson);
	smax[k] = max(smax[k<<1],smax[k<<1|1]);
	smin[k] = min(smin[k<<1],smin[k<<1|1]);	
}
int query_max(int k,int l,int r,int ql,int qr)
{
	if(qr < l || r < ql){
		return -inf;
	}
	if(ql <= l && r <= qr){
		return smax[k];
	}
	int m = (l + r) >> 1;
	int s1 = query_max(lson,ql,qr);
	int s2 = query_max(rson,ql,qr);
	return max(s1,s2);
}
int query_min(int k,int l,int r,int ql,int qr)
{
	if(qr < l || r < ql){
		return inf;
	}
	if(ql <= l && r <= qr){
		return smin[k];
	}
	int m = (l + r) >> 1;
	int s1 = query_min(lson,ql,qr);
	int s2 = query_min(rson,ql,qr);
	return min(s1,s2);
}
int main()
{
	int t,n,k;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&k);
		for(int i = 1;i <= n;i++){
			scanf("%d",&a[i]);
		}
		build(1,1,n);
		ll sum = 0;
		int r = 1;
		for(int i = 1;i <= n;i++){
			int j;
			for(j = max(r,i);j <= n;j++){		//枚举右端点 
				int ans = query_max(1,1,n,i,j) - query_min(1,1,n,i,j);
				if(ans >= k){
					break;
				}
			}	
			j--;		//端点j不在区间范围内，所以需要减一 
			//j-i+1代表这个区间有多少个复合要求的段
			//左端点l到最大右端点r中[l,r]都是符合要求的 
	//l		//例如n = 4,K = 4;1 2 3 4;
	//1		//符合条件的区间是[1,1],[1,2][1,3][1,4]; 
	//2		//[2,2][2,3][2,4]
	//3		//[3,3][3,4]
	//4		//[1,4]
			sum += j-i+1;
			r = j;		//从上一次的点继续枚举 
		}
		printf("%lld\n",sum);
	} 
	return 0;
} 

线段树 + 二分的TLE代码，留个坑慢慢想。RMQ + 二分缺能过，时间复杂度是O(nlogn + nlogn)，线段树 + 二分的时间复杂度是O(n + nlognlogn)，难道是卡常了么？

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <deque>
using namespace std;
#define lson k<<1,l,m
#define rson k<<1|1,m+1,r
#define ll long long
const int maxn = 1e6+5;
const int inf = 0x3f3f3f3f;
int a[maxn],smin[maxn<<2],smax[maxn<<2];
inline void build(int k,int l,int r)
{
    if(l == r){
        smax[k] = smin[k] = a[l];
        return ;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    smax[k] = max(smax[k<<1],smax[k<<1|1]);
    smin[k] = min(smin[k<<1],smin[k<<1|1]);    
}
int query_max(int k,int l,int r,int ql,int qr)
{
    if(qr < l || r < ql){
        return -inf;
    }
    if(ql <= l && r <= qr){
        return smax[k];
    }
    int m = (l + r) >> 1;
    int s1 = query_max(lson,ql,qr);
    int s2 = query_max(rson,ql,qr);
    return max(s1,s2);
}
int query_min(int k,int l,int r,int ql,int qr)
{
    if(qr < l || r < ql){
        return inf;
    }
    if(ql <= l && r <= qr){
        return smin[k];
    }
    int m = (l + r) >> 1;
    int s1 = query_min(lson,ql,qr);
    int s2 = query_min(rson,ql,qr);
    return min(s1,s2);
}
int main()
{
    int t,n,k;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&k);
        for(int i = 1;i <= n;i++){
            scanf("%d",&a[i]);
        }
        build(1,1,n);
        ll sum = 0;
        for(int i = 1;i <= n;i++){
            int l = i,r = n,res = i;
            while(l <= r){
                int m = (l + r) >> 1;
                int ans = query_max(1,1,n,i,m) - query_min(1,1,n,i,m);
                if(ans < k){
                	res = m;
                    l = m + 1;
                }
                else{
                    r = m - 1;
                }
            }
            sum += res - i + 1;
        }
        printf("%lld\n",sum);
    } 
    return 0;
}

愿你走出半生，归来仍是少年~