Pagini recente » Cod sursa (job #193465) | Cod sursa (job #1481751) | Cod sursa (job #2635891) | Cod sursa (job #2758626) | Cod sursa (job #1501303)
#include <iostream>
#include <fstream>
using namespace std;
int v[16001];
int main()
{
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n,k,i,max=0,st,dr,rest,p,t,mij,s=0;
fin>>n>>k;
for(i=1; i<=n; i++)
{
fin>>v[i];
s+=v[i];
if(v[i]>max)
max=v[i];
}
st=max;
dr=s;
i=1;
//cout<<st<<" "<<dr;
while(st<=dr)
{
mij=(st+dr)/2;
rest=mij;
i=1;
t=0;
while(i<=n)
{
rest=mij;
while(v[i]<=rest)
{
rest-=v[i];
i++;
}
t++;
}
if(t<k)
{
dr=mij-1;
}
else
{
st=mij+1;
p=mij-1;
}
//cout<<mij<<" "<<t<<" "<<st<<"\n";
}
fout<<p;
return 0;
}