Cod sursa(job #2083498)
| Utilizator | Data | 7 decembrie 2017 19:40:28 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int n, k, v[16001];
bool se_poate(int c)
{
int cc = 0, nr = 0;
for(int i = 1; i <= n; i++)
{
if(v[i] > c)
{
return false;
}
if(v[i] > cc)
{
nr++;
cc = c;
}
cc -= v[i];
}
return (nr <= k);
}
int main()
{
in >> n >> k;
for(int i = 1; i <= n; i++)
{
in >> v[i];
}
int r = 0, pas = 1 << 27;
while(pas != 0)
{
if(!se_poate(r+pas))
{
r += pas;
}
pas /= 2;
}
out << r + 1<< "\n";
return 0;
}
