Pagini recente » Cod sursa (job #1421073) | Cod sursa (job #2849558) | Cod sursa (job #1872355) | Cod sursa (job #210522) | Cod sursa (job #2394949)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int NMAX=16000;
int v[NMAX+5];//16000 x 4B = 64020B / 1000000 < 1MB
int n,k;
bool ok(int c)
{
int i, sc, tr;
sc=tr=0;
for(i=1; i<=n; i++)
{
if(v[i]>c)
return 0;
if(sc+v[i]<=c)
sc=sc+v[i];
else
{
tr++;
sc=v[i];
}
}
tr++;
return tr<=k;
}
int bsL(int st, int dr)
{
int med, last=-1;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i,s;
fin>>n>>k;
s=0;
for(i=1; i<=n; i++)
{
fin>>v[i]; s=s+v[i];
}
fout<<bsL(1,s);
fin.close();
fout.close();
return 0;
}