Cod sursa(job #2288037)
| Utilizator | Data | 22 noiembrie 2018 19:44:34 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16005],n,k;
bool se_poate(int c)
{
int cc=0,nr=0,i;
for (i=1;i<=n;i++)
{
if (v[i]>c)
return false;
if (v[i]>cc)
{
nr++;
cc=c;
}
cc=cc-v[i];
}
return (nr<=k);
}
int main()
{
int r=0,pas=1<<29,i;
in>>n>>k;
for (i=1;i<=n;i++)
{
in>>v[i];
}
while (pas!=0)
{
if (!se_poate(r+pas))
{
r=r+pas;
}
pas=pas/2;
}
out<<r+1;
return 0;
}
