Cod sursa(job #2204414)
Utilizator | Data | 15 mai 2018 18:44:07 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16005],max1,dr,st,t,mij,nr,ss,n,i,soll;
int main()
{
f>>n>>t;
for(i=1;i<=n;i++)
{
f>>v[i];
max1=max(v[i],max1);
dr=dr+v[i];
}
st=max1;
while(st<=dr)
{
mij=(st+dr)/2;
nr=1;
ss=0;
for(i=1;i<=n;i++)
{
if(ss+v[i]<=mij)ss=ss+v[i];
else {nr++;
ss=v[i];}
}
if(t<nr){st=mij+1;}
else {dr=mij-1;soll=mij;}
}
g<<soll;
return 0;
}