很基础的一道最大最小值问题,目标值将[l,r]区间划分为不满足条件和满足条件两部分(能否在m个月之内花完这些钱),由于当mid处在满足条件的区间时,目标值可能小于或等于mid,所以我让right=mid而不是mid-1(用mid-1也可以,但是要确保return l或者r)
#include<iostream>
#include<vector>using namespace std;
int divideDay(vector<int> mon, int limit)
{
int res = 1;
int sum = 0;
for (int i = 0; i < mon.size(); i++)
{
sum += mon[i];
if (sum>limit)
{
res++;
sum = mon[i];
}
}
return res;
}
int main()
{
int n, m;
int sum = 0, max = 0;
cin >> n>> m;
vector<int> mon(n, 0);
for (int i = 0; i < n; i++)
{
cin >> mon[i];
sum += mon[i];
max = max>mon[i] ? max : mon[i];
}
int l = max,r=sum;
int mid = 0;
while (r > l)
{
mid = (l + r) / 2;
if (divideDay(mon, mid) > m)
l = mid + 1;
else
r = mid;
}
cout << l<< endl;
}