4135:Monthly Expense（二分法）

总时间限制:

1000ms

内存限制:

65536kB

描述

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.

 

输入

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

输出

Line 1: The smallest possible monthly limit Farmer John can afford to live with.

样例输入

7 5
100
400
300
100
500
101
400

样例输出

500

提示

If Farmer John schedules the months so that the first two days are a month, the third and fourth are a month, and the last three are their own months, he spends at most $500 in any month. Any other method of scheduling gives a larger minimum monthly limit.

满分代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=100050;
int p[N];
int n,m;
int main(){
	scanf("%d%d",&n,&m);
	int max_x=0,min_x=0;
	for(int i=1;i<=n;i++){
		scanf("%d",&p[i]);
		max_x+=p[i];
		min_x=max(min_x,p[i]);
	}
	max_x+=1;
	while(min_x<max_x){
		//cout<<"min="<<min_x<<" "<<"max="<<max_x<<endl;
		int mid=(min_x+max_x)/2;
		int cnt=0,pre=0;
		for(int i=1;i<=n;i++){
			if(pre+p[i]<=mid){ 
				pre+=p[i];
			}else{
				cnt++;
				pre=p[i];
			}
		}
		//cout<<"cnt="<<cnt<<endl;
		if(cnt<m) max_x=mid;
		else min_x=mid+1;
	}
	cout<<min_x<<endl;
	return 0;
}