Cod sursa(job #2387800)
| Utilizator | Data | 25 martie 2019 11:24:41 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int n, v[16000], k;
bool se_poate(int c)
{
int nrt = 0, cc = 0;
for (int i = 0; i < n; i++)
{
if (v[i] > c)
return false;
if (v[i] > cc)
{
cc = c;
nrt++;
}
cc -= v[i];
}
return (nrt <= k);
}
int main()
{
cin >> n >> k;
int r = 0, pas = 1 << 28, i;
for (i = 0; i < n; i++)
cin >> v [i];
while (pas > 0)
{
if (!se_poate(r + pas))
{
r += pas;
}
pas /= 2;
}
cout << r + 1;
return 0;
}
