Pagini recente » Cod sursa (job #755025) | Cod sursa (job #2757964) | Cod sursa (job #83683) | Cod sursa (job #2953779) | Cod sursa (job #2947519)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int NMAX=16000;
int n,k,v[NMAX+5];
int ok(int c)
{
int tr,s,i;
tr=s=0;
for(i=1;i<=n;++i)
{
if(v[i]>c)
return k+1;
if(s+v[i]<=c)
s=s+v[i];
else
{
tr++;
s=v[i];
}
}
if(s>0)
tr++;
return tr;
}
int bsL(int st,int dr)
{
int med,last=-1;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med)<=k)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i,S;
S=0;
fin>>n>>k;
for(i=1;i<=n;++i)
{
fin>>v[i];
S=S+v[i];
}
fout<<bsL(1,S);
fin.close();
fout.close();
return 0;
}