源代码： #include<bits/stdc++.h> using namespace std; long long n,m,a[200005],r,l,mid; int main(){ scanf("%lld%lld",&n,&m); for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); a[i]++; r+=a[i]; } while(l+1<r){ mid=(l+r)/2; long long sum=0,t=1; for(int j=1;j<=n;j++){ if(sum+a[j]<=mid){sum+=a[j];} else{ t++; sum=a[j]; } } if(t<=m){ r=mid; } else{ l=mid; } } cout<<r-1; return 0; } 找半天了，终于！！！憾错······

NO!!!!!!!!!!!!!!

one hundred hours later

#include<bits/stdc++.h> using namespace std; long long n,m,a[200005],l,r,mid; int main(){ scanf("%lld%lld",&n,&m); l=0; r=0; for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); l=max(l,a[i]); r+=a[i]+1; } while(l<r){ mid=(l+r)/2; long long sum=0,t=1; for(int j=1;j<=n;j++){ if(sum==0) sum=a[j]; else if(sum+1+a[j]<=mid) sum+=1+a[j]; else t++,sum=a[j]; } if(t<=m)r=mid; else l=mid+1; } cout<<l; return 0; }