Pagini recente » Cod sursa (job #2676269) | Cod sursa (job #741983) | Cod sursa (job #584694) | Cod sursa (job #509378) | Cod sursa (job #2558438)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int NMAX=16005;
int v[NMAX],n,k;
bool ok(int med)
{
int s=0,i,cnt=0;
for(i=1;i<=n;i++)
{
s+=v[i];
if(s>med)
{
s=v[i];
cnt++;
}
else if(s==med)
{
cnt++;
s=0;
}
}
if(s!=0)
cnt++;
if(cnt<=k)
return 1;
return 0;
}
int bs(int st,int dr)
{
int med,rez,last=-1;
while(st<=dr)
{
med=(st+dr)/2;
rez=ok(med);
if(rez)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int s=0,i;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
s+=v[i];
}
fout<<bs(1,s);
return 0;
}