Pagini recente » Borderou de evaluare (job #2830510) | Cod sursa (job #2519744) | Cod sursa (job #207482) | Cod sursa (job #737869) | Cod sursa (job #752258)
Cod sursa(job #752258)
#include<fstream.h>
long v[16001],t,c,s,k,i,n,max;
int main()
{
ifstream in("transport.in");
ofstream out("transport.out");
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v[i];
if(v[i]>max)
max=v[i];
}
t=k+1;
while(t>k)
{
t=0;
c=1;
while(c<=n)
{
s=0;
for(i=c;i<=n&&s+v[i]<=max;i++)
s+=v[i];
c=i;
t++;
}
max++;
}
out<<max-1;
return 0;
}