Pagini recente » Cod sursa (job #386232) | Cod sursa (job #488705) | Cod sursa (job #1546648) | Cod sursa (job #1484958) | Cod sursa (job #377468)
Cod sursa(job #377468)
#include <cstdio>
#define DIM 16010
using namespace std;
int i, sum[DIM], A[DIM], upbound = DIM, lowbound, K, N;
int cbin (int low, int up)
{
int sol = 0, mid, k, x;
while ( low <= up )
{
mid = low + ( (up - low) >> 1 );
k = 0;
for ( x = 0, i = 1; i <= N + 1; i++)
{
++ k;
x = A[i];
while ( x <= mid && i <= N )
x += A[i], ++i;
if ( x > mid ) --i;
}
if (k > K) low = mid + 1;
else if (k == K) sol = mid, up = mid - 1;
else if (k < K ) up = mid-1;
}
return sol;
}
void solve ()
{
scanf ("%d%d\n", &N, &K);
for (i = 1; i <= N; i++)
{
scanf ("%d\n", &A[i]);
if (lowbound < A[i]) lowbound = A[i];
}
printf ("%d\n", cbin (lowbound, upbound) );
}
int main ()
{
freopen ("transport.in", "r", stdin);
freopen ("transport.out", "w", stdout);
solve ();
return 0;
}