Pagini recente » Cod sursa (job #2080198) | Cod sursa (job #2255383) | Cod sursa (job #2001562) | Cod sursa (job #2140070) | Cod sursa (job #1879051)
#include <fstream>
using namespace std;
const int NMAX=16000;
int v[NMAX+5];
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int n,k,i,total,med,st,dr,tr,last,s;
fin>>n>>k;
total=0;
for(i=1;i<=n;i++)
{
fin>>v[i];
total=total+v[i];
}
st=1;
dr=total;
while(st<=dr)
{
med=(st+dr)/2;
s=0;
/*calculam cate transporturi
sunt necesare pentru a transporta toate
saltelele cu un camion de capacitate med*/
tr=0;
for(i=1;i<=n;i++)
{
if(v[i]>med)
{
tr=k+1;
break;
}
if(s+v[i]<=med)
{
s=s+v[i];
}
else
{
tr++;
s=v[i];
}
}
if(s<=med)
tr++;
if(tr<=k)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
fout<<last<<"\n";
fin.close();
fout.close();
return 0;
}