Pagini recente » Cod sursa (job #1560360) | Cod sursa (job #2377971) | Cod sursa (job #536552) | Cod sursa (job #2828354) | Cod sursa (job #2850617)
#include <fstream>
using namespace std;
const int NMAX=16000;
int v[NMAX+5];
int n,k;
ifstream fin("transport.in");
ofstream fout("transport.out");
int ok(int C)
{
int tr,s,i;
tr=s=0;
for(i=1; i<=n; ++i)
{
if(v[i]>C)
return k+1;
s=s+v[i];
if(s>C)
{
tr++;
s=v[i];
}
}
if(s>0)
tr++;
return tr;
}
int bs(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,vmax;
vmax=0;
fin>>n>>k;
for(i=1; i<=n; ++i)
{
fin>>v[i];
vmax=vmax+v[i];
}
fout<<bs(1,vmax);
fin.close();
fout.close();
return 0;
}