Pagini recente » Cod sursa (job #3144677) | Cod sursa (job #1015334) | Cod sursa (job #805735) | Cod sursa (job #184243) | Cod sursa (job #626996)
Cod sursa(job #626996)
#include<stdio.h>
#define N 16001
long a[N],n,i,k,s[N],x,c,l,t,y,m;
int main()
{freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%ld%ld",&n,&k);
for(i=1;i<=n;i++)
{scanf("%ld",&a[i]),s[i]=s[i-1]+a[i];
if(m<a[i])
m=a[i];}
c=m+1;
while(1)
{i=1,t=x=0;
while(i<=n)
{while(i<=n&&s[i]-s[t]<=c)
i++;
t=i-1,x++;}
if(x==k)
y=1;
if(!y)
if(x<k)
c--;
else
c++;
else
{if(x!=k)
break;
c--;}}
printf("%ld",c+1);
return 0;}