Cod sursa(job #1533882)
| Utilizator | Data | 23 noiembrie 2015 03:08:12 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,m,v[20000];
int cautbin(int st,int dr)
{
if(st==dr)
return st;
int s=0,nr=1,i,mij=(st+dr)/2;
for(i=n;i>0;i--)
{
if(s+v[i]>mij)
{
s=v[i];
nr++;
}
else
s+=v[i];
}
if(nr>k)
return cautbin(mij+1,dr);
else
return cautbin(st,mij);
}
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>v[i];
if(m<v[i])
m=v[i];
}
g<<cautbin(m,256000000);
return 0;
}
