Cod sursa(job #2117078)
Utilizator | Mihai Modi mihaimodi | Data | 28 ianuarie 2018 15:06:51 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.78 kb |
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,sum,v[16001],i,Max,a,s,st,dr,mij,sol,nr;
int main()
{
fin>>n>>nr;
for(i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]>Max)
Max=v[i];
s=s+v[i];
}
st=Max;
dr=s;
sol=0;
while(st<=dr)
{
mij=(st+dr)/2;//capacitatea
k=1;sum=0;
for(i=1;i<=n;i++)
{
if(sum+v[i]<=mij)
sum=sum+v[i];
else
{
k++;
sum=v[i];
}
}
if(k>nr)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
}
fout<<sol;
return 0;
}