Pagini recente » Cod sursa (job #1703202) | Cod sursa (job #2614150) | Cod sursa (job #819382) | Cod sursa (job #3277726) | Cod sursa (job #2528715)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("transport.in");
ofstream fout("transport.out");
int a[16003], n, k;
int Test (int C)
{
///ret 1 daca pot imparti vect
///in cel mult k secv fiecare
///secv avand suma <= C
int s = 0, i, cnt = 1;
for (i = 1; i <= n;i++)
{
if (a[i] > C) return 0;
if (s + a[i] <= C)
s += a[i];
else
{
cnt++;
s = a[i];
}
}
return (cnt <= k);
}
int CB()
{
int st, dr, mij, p;
st = p = 1;
dr = 256000000;
while (st <= dr)
{
mij = (st + dr) / 2;
if (Test(mij) == 1)
{
p = mij;
dr = mij - 1;
}
else st = mij + 1;
}
return p;
}
int main()
{
int i;
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> a[i];
fout << CB();
return 0;
}