题目链接:http://poj.org/problem?id=3273
3273 Monthly Expense
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 29200
Accepted: 11090escription
Description
Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi ≤ 10,000) that he will need to spend each day over the next N (1 ≤ N ≤ 100,000) days.
FJ wants to create a budget for a sequential set of exactly M (1 ≤ M ≤ N) fiscal periods called “fajomonths”. Each of these fajomonths contains a set of 1 or more consecutive days. Every day is contained in exactly one fajomonth.
FJ’s goal is to arrange the fajomonths so as to minimize the expenses of the fajomonth with the highest spending and thus determine his monthly spending limit.
Input
Line 1: Two space-separated integers: N and M
Lines 2..N+1: Line i+1 contains the number of dollars Farmer John spends on the ith day
Output
Line 1: The smallest possible monthly limit Farmer John can afford to live with.
Sample Input
7 5
100
400
300
100
500
101
400
Sample Output
500
题意:给定一个长度为 n 的数组,分成 m 份,求区间和最大值的最小值。
思路:分的组越多,区间和最大值越小,单调递减,可以用二分来找分的组。
附上ac代码
#include<iostream>
#include<cstdio>
#define maxn 100005
using namespace std;
int a[maxn];
int main(){
int n, m;
scanf("%d%d", &n, &m);
int s = 0, ma = 0;
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
s += a[i];
ma = max(ma, a[i]);
}
int mid;
while(ma < s){
mid = (ma + s) >> 1;
int tmp = 0, cnt = 0;
for(int i = 0; i < n; i++){
tmp += a[i];
if(tmp > mid){
tmp = a[i];
cnt++;
}
}
if(cnt < m)
s = mid;
else
ma = mid + 1;
}
printf("%d\n", ma);
return 0;
}