Pagini recente » Cod sursa (job #2020892) | Cod sursa (job #82824) | Cod sursa (job #783570) | Cod sursa (job #2831831) | Cod sursa (job #2561269)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16005];
int main()
{
int n,k,i,j,nr;
long long volumcamion,dr,st,med,volumtotal,s;
fin>>n>>k;
volumtotal=0;
nr=0;
s=0;
for(i=1;i<=n;i++)
{
fin>>v[i];
volumtotal=volumtotal+v[i];
}
st=1;
dr=volumtotal;
med=(st+dr)/2;
while(st<=dr)
{
med=(st+dr)/2;
s=0;
nr=0;
for(i=1;i<=n;i++)
{
if(v[i]>med)
{
nr=k+1;
break;
}
else if(s+v[i]>med)
{
nr++;
s=v[i];
}
else
s=s+v[i];
}
nr++;
if(nr>k)
{
st=med+1;
}
else if(nr<=k)
{
dr=med-1;
volumcamion=med;
}
}
fout<<volumcamion;
return 0;
}