Pagini recente » Cod sursa (job #908502) | Cod sursa (job #1532662) | Cod sursa (job #2953337) | Cod sursa (job #2436306) | Cod sursa (job #370563)
Cod sursa(job #370563)
#include<fstream.h>
int n,s,k,i,fin,p,a[16000],x;
int main()
{
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1;i<=n;i++){f>>a[i];if(a[i]>x)x=a[i];}
x--;
p=k+1;
while(p>k)
{
x++;
p=0;
i=1;
s=0;
fin=0;
while(i<=n&!fin)
{
while(s+a[i]<=x&&!fin){s+=a[i];if(i<n)i++;else fin=1;}
p++;s=0;
}
}
g<<x;
return 0;
}