Pagini recente » Cod sursa (job #41138) | Cod sursa (job #2454786) | Rating Niculescu Rares-Cosmin (autostrada_2) | Cod sursa (job #2334884) | Cod sursa (job #1708580)
#include <cstdio>
int v[16000];
using namespace std;
int main()
{
freopen( "transport.in", "r", stdin );
freopen( "transport.out", "w", stdout );
int n, k, c, i, j, m=0, l, min=0, ok=0;
scanf( "%d%d", &n, &k );
for( i=1;i<=n;i++ )
{
scanf( "%d", &v[i] );
if( v[i]>min )
min=v[i];
v[i]+=v[i-1];
}
for( l=min;!ok;l++ )
{
c=0;
for( i=1;i<=n && c<k && !ok;i++ )
{
j=i;
while( v[j]-v[m]<min )
j++;
if( j>i )
c++;
else
ok=1;
i=m=j-1;
}
if( i==n+1 && c==k )
ok=1;
}
printf( "%d", l );
return 0;
}