摘要： 简单二分，下限为每天花费的最大值，上限是所有天数花费的总和．#include<iostream>#include<cstdio>usingnamespacestd;intmon[100005];inti,j,n,m;intjud(intmid){ints=0,count=1;for(i=0;i<n;i++){s+=mon[i];if(s>mid){s=mon[i];count++;}}if(count>m)returntrue;elsereturnfalse;}intmain(){intans;intmax,sum;while(scanf(" 阅读全文