Pagini recente » Cod sursa (job #17080) | Cod sursa (job #1531728) | Cod sursa (job #362258) | Cod sursa (job #2696987) | Cod sursa (job #311933)
Cod sursa(job #311933)
#include<fstream.h>
int lucru()
{int i,in,n,k,nd,c,v[16001];
ifstream q("transport.in");
ofstream w("transport.out");
q>>n>>k;
nd=k+1;
int max=0;
for(i=1;i<=n;i++)
{q>>v[i];
if(max<v[i])
max=v[i];}
c=max-1;
while(nd>k)
{nd=0;
c++;
in=0;
for(i=1;i<=n;i++)
{if(in+v[i]<=c)
in=in+v[i];
else
{nd++;
in=0;
i--;}}
nd++;}
w<<c;
return 0;}
int main()
{lucru();
return 0;}