Cod sursa(job #1474236)
Utilizator | Lucian Trepteanu LucianT | Data | 21 august 2015 16:31:24 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
int n,k,s,mmax,i,v[16005],st,dr;
int main()
{
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
s+=v[i];
if(mmax<v[i]) mmax=v[i];
}
st=mmax-1,dr=s+1;
int sm=0,trans=1,mij,i;
while(st+1<dr)
{
mij=(st+dr)/2;
sm=0;trans=1;
for(i=1;i<=n && trans<=k;i++)
{
if(sm+v[i]<=mij) sm+=v[i];
else sm=v[i],trans++;
}
if(trans>k) st=mij;
else dr=mij;
}
g<<dr;
return 0;
}