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 ≤ moneyi ≤ 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的，說明我們當前設定的最大值太大，需要變小一些。
代碼如下：

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define ll long long #define inf 0x3f3f3f3f using namespace std;const int maxx=1e5+100; int a[maxx]; int n,m;bool fcs(int mid) {int cnt=0;int sum=0;for(int i=1;i<=n;i++){if(a[i]>mid) return 0;if(sum+a[i]<mid) sum+=a[i];else if(sum+a[i]==mid) sum=0,cnt++;else sum=0,cnt++,i--;}if(sum<=mid) cnt++;return cnt<=m;//這里需要注意 } int main() {while(~scanf("%d%d",&n,&m)){int r=0;for(int i=1;i<=n;i++) scanf("%d",&a[i]),r+=a[i];int l=0,mid,ans;while(l<=r){mid=l+r>>1;if(fcs(mid)){ans=mid;r=mid-1;}else l=mid+1;}cout<<ans<<endl;}return 0; }

努力加油a啊

總結

以上是生活随笔為你收集整理的Monthly Expense POJ - 3273（二分最大值最小化）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。