Pagini recente » Cod sursa (job #2105424) | Cod sursa (job #2017911) | Cod sursa (job #1726673) | Cod sursa (job #1997247) | Cod sursa (job #1830266)
#include <fstream>
#include <limits.h>
using namespace std;
int n,k,S,Max,dr,st,i,j,mid,s,nr,sol,v[16001];
int main()
{
ifstream cin("transport.in");
ofstream cout("transport.out");
cin>>n>>k;
S=0;
Max=0;
for(i=1;i<=n;i++){
cin>>v[i];
S=S+v[i];
if(v[i]>Max)
Max=v[i];
}
st=Max;
dr=S;
while(st<=dr){
mid=(st+dr)/2;
nr=1;
s=v[1];
for(j=2;j<=n;j++)
if(s+v[j]<=mid)
s=s+v[j];
else{
s=v[j];
nr++;
}
if(nr<=k){
sol=mid;
dr=mid-1;
}
else
st=mid+1;
}
cout<<sol;
return 0;
}