2018 华中科技校赛 K Walking in the Forest 最大化最小值

链接： https://www.nowcoder.com/acm/contest/106/K
来源：牛客网

题目描述 
It’s universally acknowledged that there’re innumerable trees in the campus of HUST.
Now you're going to walk through a large forest. There is a path consisting of N stones winding its way to the other side of the forest. Between every two stones there is a distance. Let di indicates the distance between the stone i and i+1.Initially you stand at the first stone, and your target is the N-th stone. You must stand in a stone all the time, and you can stride over arbitrary number of stones in one step. If you stepped from the stone i to the stone j, you stride a span of (di+di+1+...+dj-1). But there is a limitation. You're so tired that you want to walk through the forest in no more than K steps. And to walk more comfortably, you have to minimize the distance of largest step.
输入描述:
The first line contains two integer N and K as described above.
Then the next line N-1 positive integer followed, indicating the distance between two adjacent stone.
输出描述:
An integer, the minimum distance of the largest step.
示例1
输入
6 3
1 3 2 2 5
输出

5

#include<bits/stdc++.h>
#define maxn 100010
#define ll long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
int a[maxn];
int n,k;
bool check(ll t)
{
    ll cnt=0;
    ll s=0;
    for(int i=1;i<n;i++)
    {
        if(a[i]>t)
            return false;
        if(cnt+a[i]<=t)
            cnt+=a[i];
        else
        {
            s++;
            cnt=a[i];
        }
    }
    return s<k;
}
int main()
{
    cin>>n>>k;
    ll l=0,r=0;
    for(int i=1;i<n;i++)
    {
        cin>>a[i];
        r+=a[i];
    }
    while(l<r-1)
    {
        ll mid=(l+r)/2;
        //cout<<mid<<endl;
        if(check(mid))
            r=mid;
        else
            l=mid;
    }
    cout<<r<<endl;
    return 0;
}