Pagini recente » Cod sursa (job #1686638) | Cod sursa (job #223921) | Cod sursa (job #802805) | Cod sursa (job #329575) | Cod sursa (job #2522503)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,st,dr,m,s,sol,maxx,nr,v[16001];
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]>maxx) maxx=v[i];
s+=v[i];
}
st=maxx;
dr=s;
m=(st+dr)/2;
while(st<=dr)
{
s=0;
nr=0;
for(int i=1;i<=n;i++)
{
s+=v[i];
if(s>m&&i!=n) {nr++; s=v[i];}
else if(i==n) nr++;
}
if(s-m>0) nr++;
if(nr<=k)
{
sol=m;
dr=m-1;
}
else st=m+1;
m=(st+dr)/2;
}
fout<<sol;
return 0;
}