Pagini recente » Cod sursa (job #627999) | Cod sursa (job #2766433) | Cod sursa (job #654361) | Cod sursa (job #1960986) | Cod sursa (job #3276904)
#include <fstream>
using namespace std;
const int N = 16000;
const int VMAX = 16000;
const int CMIN = 1;
const int CMAX = N * VMAX;
int n, k;
int v[N];
bool se_pot_transporta(int c)
{
int c_c = c, nr_t = 1;
for (int i = 0; i < n; i++)
{
if (v[i] > c)
{
return false;
}
if (v[i] > c_c)
{
nr_t++;
c_c = c;
}
c_c -= v[i];
}
return (nr_t <= k);
}
int caut_bin_capacitatea()
{
int st = CMIN, dr = CMAX, rez = dr + 1;
while (st <= dr)
{
int m = (st + dr) / 2;
if (se_pot_transporta(m))
{
rez = m;
dr = m - 1;
}
else
{
st = m + 1;
}
}
return rez;
}
int main()
{
ifstream in("transport.in");
ofstream out("transport.out");
in >> n >> k;
for (int i = 0; i < n; i++)
{
in >> v[i];
}
out << caut_bin_capacitatea() << "\n";
in.close();
out.close();
return 0;
}