二分答案题

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
ll n,a[1000001],m,sum[100001];
bool check(ll mid){
    int now=0;
    int t=0;
    for(int i=1;i<=n;i++){
        if(sum[i]-sum[now]>mid){
            t++;
            now=i-1;
        }
    }
    if(t>=m)return true;
    else return false;
}


int main(){
    cin>>n>>m;
    ll r,l=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        sum[i]=a[i]+sum[i-1];
        l=max(l,a[i]);
    }
    r=sum[n];
    while(l<=r){
        ll mid=(l+r)/2;
        if(check(mid))
            l=mid+1;
            
            else r=mid-1;
    }
    cout<<l;
    return 0;
}