Pagini recente » Cod sursa (job #1984469) | Cod sursa (job #1570951) | Cod sursa (job #2205092) | Cod sursa (job #885556) | Cod sursa (job #3204098)
#include <fstream>
using namespace std;
const int N = 16000;
const int VMAX = 16000;
int v[N];
bool incap(int v[], int n, int t, int cap)
{
int cap_c = 0, nr_t = 0;
for (int i = 0; i < n; i++)
{
if (v[i] > cap)
{
return false;
}
if (v[i] > cap_c)
{
nr_t++;
cap_c = cap;
}
cap_c -= v[i];
}
return (nr_t <= t);
}
int caut_bin(int v[], int n, int t)
{
int st = 1, dr = N*VMAX, rez = dr + 1;
while (st <= dr)
{
int m = (st + dr) / 2;
if (incap(v, n, t, m))
{
rez = m;
dr = m - 1;
}
else
{
st = m + 1;
}
}
return rez;
}
int main()
{
ifstream in("transport.in");
ofstream out("transport.out");
int n, t;
in >> n >> t;
for (int i = 0; i < n; i++)
{
in >> v[i];
}
out << caut_bin(v, n, t) << "\n";
in.close();
out.close();
return 0;
}