独立完成了一道题

洛谷P1182 数列分段 Section II 记录

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M, temp;
vector<ll> v;
bool check(ll mid){
ll chap = 1;
ll sum = 0;

for(ll i = 0; i < N; i++){
if(v[i] > mid) return false;
}
for(ll i = 0; i < N; i++){
sum += v[i];
if(sum > mid){
chap++;
sum = 0;
i--;
}
}
if(chap > M) return false;
return true;

}
void solve(){
if(!(cin >> N >> M)) return;
for(ll i = 0; i < N; i++){
cin >> temp;
v.push_back(temp);

}
ll l = 0;
ll r = 1e9;
while(l < r){
ll mid = l + (r - l) / 2;
if(check(mid)){
r = mid;
}else {
l = mid + 1;
}
}
cout << l;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}