Pagini recente » Cod sursa (job #2295552) | Cod sursa (job #854093) | Cod sursa (job #2981671) | Cod sursa (job #2849101) | Cod sursa (job #2528714)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int a[16003], n, k;
///ret. 1 daca pot imparti vectorul in cel mult k secv.
///fiecare secv. avand suma <= C
int Test(int C)
{
int s = 0, cnt = 1;
for (int 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 CautBin()
{
int st, dr, mij, p;
st = 1;
dr = 256e6;
p = 1;
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 << CautBin();
return 0;
}