Pagini recente » Cod sursa (job #1028630) | Cod sursa (job #2186495) | Cod sursa (job #2782491) | Cod sursa (job #3041066) | Cod sursa (job #3152185)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int nmax=16000;
int v[nmax], n;
int check(int vl)
{
int s=0, cnt=1;
for(int i=0; i<n; i++)
{
if(v[i] > vl) cnt=nmax;
if(s+v[i] > vl)
{
s=0;
cnt++;
}
s+=v[i];
}
return cnt;
}
int cb(int st, int dr, int k)
{
int mij, tr, l;
while(st<=dr)
{
mij=(st+dr)/2;
tr=check(mij);
if(tr<=k)
{
dr=mij-1;
l=mij;
}
else st=mij+1;
}
return l;
}
int main()
{
int k;
fin >> n >> k;
for(int i=0; i<n; i++) fin >> v[i];
fout << cb(0, nmax ,k);
return 0;
}