Pagini recente » Cod sursa (job #1528) | Cod sursa (job #1094556) | Cod sursa (job #2012745) | Cod sursa (job #1543238) | Cod sursa (job #1801968)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,v[16001],i,mn;
int run(int mij)
{
int i,j=1,s=0,cnt=1;
for(i=1; i<=n ; i++)
{
if(s+v[i]>mij)
{
cnt++;
s=0;
if(v[i]>mij)
return 0;
--i;
}
else
s+=v[i];
}
return cnt<=k;
}
int caut_bin(int ls,int ld)
{
if(ls<=ld)
{
int m=(ls+ld)/2;
if(run(m))
{
mn=m;
caut_bin(ls,m-1);
}
else
caut_bin(m+1,ld);
}
}
int main()
{
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
caut_bin(1,16000*16000);
g<<mn;
}