poj_3273

源地址：http://poj.org/problem?id=3273

题目大意就是给n个数字，要求分成m块连续的天数，使得每组的天数和尽量小，求在天数和尽量小的条件下，最大的天数和。

二分，左边界是天数中最大的，右边界是总的天数和，二分的结果就是一个天数和，使得分组的每组和都不超过这个天数。最后输出这个天数即可。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-3
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 510
#define M 1000100
const int size = 10010;
const int mod = 9901;
int days[100010];
bool Check(ll mon){
	int groups = 1;
	ll money = 0;
	for(int i=0;i<n;i++){
		if(money+days[i]<=mon){
			money += days[i];
		}else{
			groups++;
			money = days[i];
		}
	}
	return (groups>m);
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    while(scanf("%d%d",&n,&m)!=EOF){
    	ll r = 0;
    	ll l = 0;
    	for(int i=0;i<n;i++){
    		scanf("%d",&days[i]);
    		r += (ll)days[i];
    		l = Max(l,(ll)days[i]);
    	}
    		ll mid = (l+r)>>1;
    		while(l<=r){
    			if(Check(mid))	//if true,说明 groups比m小，也就是分的组太少了，即天数太小了
    				l = mid+1;
    			else
    				r = mid-1;
    			if(l>r) break;
    			mid = (l+r)>>1;
    		}
    		printf("%I64d\n",mid);
    }
return 0;
}