HDOJ 5289 Assignment 单调队列

【HDOJ 5289 Assignment 单调队列】的更多相关文章

HDOJ 5289 Assignment 单调队列

维护一个递增的和递减的单调队列 Assignment Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 78 Accepted Submission(s): 40 Problem Description Tom owns a company and he is the boss. There are n staffs which a…

HDU 5289 Assignment(单调队列)

题意:给T足数据,然后每组一个n和k,表示n个数,k表示最大同意的能力差,接下来n个数表示n个人的能力,求能力差在k之内的区间有几个分析:维护一个区间的最大值和最小值,使得他们的差小于k,于是採用单调队列普通单调队列做法: #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; const int maxn = 1e6+5; i…

二分+RMQ/双端队列/尺取法 HDOJ 5289 Assignment

题目传送门 /* 题意:问有几个区间最大值-最小值 < k 解法1:枚举左端点,二分右端点,用RMQ(或树状数组)求区间最值,O(nlog(n))复杂度解法2:用单调队列维护最值,O(n)复杂度,用法解法3:尺取法,用mutiset维护最值 */ #include <cstdio> #include <algorithm> #include <cstring> #include <cmath> using namespace std; typede…

HDU - 5289 Assignment (RMQ+二分)(单调队列)

题目链接: Assignment 题意: 给出一个数列,问其中存在多少连续子序列,使得子序列的最大值-最小值<k. 题解: RMQ先处理出每个区间的最大值和最小值(复杂度为:n×logn),相当于求出了每个区间的最大值-最小值.那么现在我们枚举左端点,二分右端点就可以在n×logn×logn的时间内过. #include<bits/stdc++.h> using namespace std; ; int vec[MAX_N]; ]; ]; ; int N,M,T; void ST(in…

HDU 5289 Assignment（多校2015 RMQ 单调（双端）队列）

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5289 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 tas…

HDU - 5289：Assignment（单调队列||二分+RMQ||二分+线段树）

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…

ACM学习历程—HDU 5289 Assignment(线段树 || RMQ || 单调队列)

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 gr…