题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3486
题目大意: 给定n个数的序列,让我们找前面k个区间的最大值之和,每个区间长度为n/k,如果有剩余的区间长度不足n/k则无视之。现在让我们找最小的k使得和严格大于m。n<=20万,m <= 10亿。
题目大意: 给定n个数的序列,让我们找前面k个区间的最大值之和,每个区间长度为n/k,如果有剩余的区间长度不足n/k则无视之。现在让我们找最小的k使得和严格大于m。n<=20万,m <= 10亿。
解题思路:简单RMQ,二分枚举区间个数,然后判断当前的区间个数k是否符合找出来的区间之和大于m,如果符合就往更小的找,如果不符合就往大的找。本题我的RMQ代码巨搓,跑了800多ms。一气之下写了个暴力写法,31ms,哈哈..数据比较特殊,不然RMQ要比暴力快很多。我给一个RMQ的代码。
11 300
7 100 7 101 100 100 9 100 100 110 110
-1 -1
#include <stdio.h>
#include <string.h>
#include <math.h>
#define MAX 210000
#define max(a,b) ((a)>(b)?(a):(b))
int n, m, ans;
struct RMQ {
int n, dp[MAX][20];
void Create();
int Query(int l, int r);
} rmq;
void RMQ::Create() {
int t = (int) (log(double(n)) / log(2.0));
for (int j = 1; j <= t; ++j)
for (int i = 1; i + (1 << j) - 1 <= n; ++i)
dp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
}
int RMQ::Query(int l, int r) {
int k = (int) (log(r - l + 1.0) / log(2.0));
//printf("l = %d r = %d max = %d\n",l,r,max(dp[l][k],dp[r-(1<<k)+1][k]));
return max(dp[l][k], dp[r - (1 << k) + 1][k]);
}
int Solve() {
int i, j, len, flag, sum;
int high, low, mid;
ans = -1;
low = 1, high = n;
while (low <= high) {
mid = low + (high - low) / 2;
sum = 0, len = n / mid;
for (i = 1; i <= mid; ++i)
sum += rmq.Query(len * (i - 1) + 1, len * i);
if (sum > m) ans = mid, high = mid - 1;
else low = mid + 1;
}
return ans;
}
void in(int &a) {
char c;
while ((c = getchar()) < '0' || c > '9');
for (a = 0; c >= '0' && c <= '9'; c = getchar())a = a * 10 + c - '0';
}
int main() {
int i, j, k, sum;
while (scanf("%d%d", &n, &m), n >= 0 || m >= 0) {
rmq.n = n;
for (i = 1; i <= n; ++i)
in(rmq.dp[i][0]);
rmq.Create();
ans = Solve();
printf("%d\n", ans);
}
}
本文ZeroClock原创,但可以转载,因为我们是兄弟。