Cod sursa(job #2623445)
Utilizator | Theodor Moroianu theodor.moroianu | Data | 3 iunie 2020 10:43:46 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream in("transport.in");
ofstream out("transport.out");
int n, k;
in >> n >> k;
vector <int> v(n);
for (auto & i : v)
in >> i;
auto verif = [&](int dim) -> bool {
int need = 0, last = 0;
for (auto i : v) {
if (i > last)
need++, last = dim;
last -= i;
if (last < 0)
return false;
}
return need <= k;
};
int ans = 0;
for (int pas = (1 << 30); pas; pas /= 2)
if (!verif(ans + pas))
ans += pas;
out << ans + 1 << '\n';
return 0;
}