Pagini recente » Cod sursa (job #124067) | Cod sursa (job #292204) | Cod sursa (job #788134) | Cod sursa (job #152018) | Cod sursa (job #2782521)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
int main()
{
int n,k,mx=0,st,dr,mj,sum=0,s=0,cnt=0,a;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
sum=sum+v[i];
if(v[i]>mx)
{
mx=v[i];
}
}
st=mx;
dr=sum;
while(st<=dr)
{
mj=(st+dr)/2;
for(int i=1;i<=n;i++)
{
s=s+v[i];
if(s>mj)
{
cnt++;
s=v[i];
}
}
if(s<=mj)
{
cnt++;
}
if(cnt<=k)
{
a=mj;
dr=mj-1;
}
else
{
st=mj+1;
}
cnt=0;
s=0;
}
fout<<a;
return 0;
}