Pagini recente » Cod sursa (job #1259589) | Cod sursa (job #122330) | Cod sursa (job #840420) | Cod sursa (job #1640399) | Cod sursa (job #388175)
Cod sursa(job #388175)
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16001],n,k,s,i,maxim,t,c,st,dr,sol,m;
int main()
{
f>>n>>k;maxim=0;
for(i=1;i<=n;i++)
{f>>v[i];
s=s+v[i];
if(v[i]>maxim) maxim=v[i];}
st=maxim; dr=s; c=0; t=1;
while(st<=dr)
{m=(st+dr)/2;t=1;c=0;
for(i=1;i<=n;i++)
{if(v[i]+c<=m) c=c+v[i];
else {c=v[i];
t++;}}
if(t<=k) {dr=m-1; sol=m;}
else st=m+1;}
g<<sol;
f.close(); g.close();
return 0;
}