Pagini recente » Cod sursa (job #1476688) | Cod sursa (job #2172491) | Cod sursa (job #875636) | Cod sursa (job #1313625) | Cod sursa (job #2910980)
#include <fstream>
using namespace std;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n, v[16002];
int k, st, dr, mid, c;
int nrt, s;
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
{fin>>v[i]; dr+=v[i]; st=max(st, v[i]);}
while(st<=dr)
{
mid=(st+dr)/2;
///calculez cate transporturi ar fi necesare cu un camion de dimesniunea mid
nrt=1, s=0;
for(int i=1; i<=n; i++)
{
if(s+v[i]>mid)
{
nrt++;
s=v[i];
}
else
s+=v[i];
}
if(nrt>k)
st=mid+1;
else
dr=mid-1;
}
fout<<st;
return 0;
}