题目链接:
HDU 3486 Interviewe
题意:
要求从
n
个人中,选择最少的人使得这些人的权值大于
数据范围:
n≤20000
分析:
RMQ.
先用
RMQ
处理区间最值,时间复杂度
O(nlogn)
。
然后枚举选择的人数,从最小枚举,然后检查即可。
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
const int MAX_N = 200010;
int n, limit;
int data[MAX_N], dp[MAX_N][20], mylog[MAX_N];
void RMQ()
{
memset(dp, 0, sizeof(dp));
int k = (int)log2(n * 1.0);
for (int i = 0; i < n; ++i) { dp[i][0] = data[i]; }
for (int j = 1; j <= k; ++j) {
for (int i = 0; i + (1 << j) - 1 < n; ++i) {
int k = i + (1 << (j - 1));
dp[i][j] = max(dp[i][j - 1], dp[k][j - 1]);
}
}
}
bool check(int num)
{
int len = n / num; // len 是选择间隔
int res = 0, e = (int)log2(len * 1.0);
for (int i = 0; i < len * num; i += len) {
int j = i + len - (1 << e);
res += max(dp[i][e], dp[j][e]);
if (res > limit) return true;
}
return false;
}
int main()
{
while (~scanf("%d%d", &n, &limit)) {
if (n == -1 && limit == -1) break;
int Max = 0, sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &data[i]);
Max = max(Max, data[i]);
sum += data[i];
}
if (sum <= limit) {
printf("-1\n");
continue;
}
RMQ();
int least = limit / Max;
if (limit % Max) least++; // least是最小人数
for (int i = least; i <= n; ++i) { //枚举选择人数
if (check(i)) {
printf("%d\n", i);
break;
}
}
}
return 0;
}