Pagini recente » Cod sursa (job #1189650) | Cod sursa (job #926768) | Monitorul de evaluare | Cod sursa (job #921145) | Cod sursa (job #131206)
Cod sursa(job #131206)
#include <stdio.h>
#include <fstream.h>
int a[16010],n,kk;
int nr=0;
long S,max=0;
void citire()
{
ifstream fin("transport.in");
fin>>n>>kk;
for (int i=0;i<n;i++)
{ fin>>a[i];
S+=a[i];
max=max>a[i]?max:a[i];
}
fin.close();
}
long parc ()
{
S/=n;
if (S>max)
max=S;
for (long i=max;;i++){
int k=0,aux=0,S=0;
while (k<n)
{
while (S+a[k]<=i && k<n)
{
S+=a[k++];
}
S=0;
aux++;
}
if (aux<=kk)
return i;
}
}
int main ()
{
citire();
freopen ("transport.out","w",stdout);
printf("%ld\n",parc());
fclose(stdout);
return 0;
}