Cod sursa(job #2182180)
| Utilizator | Data | 22 martie 2018 10:53:43 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out ("transport.out");
int const L=27;
int v[16001], n, k;
bool sepoate(int c)
{
int nr=0, cc=0;
for (int i=0; i<n; i++)
{
if(v[i]>cc)
{
nr++;
cc=c;
}
if(v[i]>cc)
return false;
if(nr>k)
{
return false;
}
cc-=v[i];
}
return true;
}
int main()
{
in>>n>>k;
for(int i=0; i<n; i++)
{
in>>v[i];
}
int r=0, pas=1<<L;
while(pas!=0)
{
if(!sepoate(r+pas))
{
r+=pas;
}
pas/=2;
}
out<<r+1;
in.close();
out.close();
return 0;
}
