POJ-3273

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 ≤ money_i ≤ 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

Hint

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.

思路：二分地量就不说了，都懂得，关键在于判定，可以通过你模拟的值（即二分时的量）来进行周期划分，看满足你模拟的值最少周期数是多少，如果大于
m,显然是不满足的，如果小于，那么划分m组是绰绰有余的，等于就不用说了。。重要的是注意确定一个分段点后，起点在哪儿，是最后一个满足的数？还是接下来这个不满足的数？而且要注意比较一天的情况，因为一天也可能是一个周期。代码有详细的标注。

AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;




int main()
{
int N,M,sum=0,max=0,left,right,mid;

cin>>N>>M;

int a[N];

for(int i=0;i<N;i++)
{
cin>>a[i];
sum+=a[i];
if(a[i]>max)
max=a[i];
}

left=max;
right=sum;

int count,sum2;
while(left<right)
{
count=1,sum2=0;
mid=(left+right)/2;
for(int i=0;i<N;i++)
{
sum2+=a[i];
if(sum2>mid)
{
count++;
sum2=a[i];

}

}
if(count>M)
{
left=mid+1;
}
else
{
right=mid-1;
}
}

cout<<right<<endl;


return 0;
}