Pagini recente » Cod sursa (job #2660433) | Cod sursa (job #2313288) | Istoria paginii runda/rar18 | Cod sursa (job #2592330) | Cod sursa (job #2055607)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v1[16001];
int main()
{
int n,k,nr,i,maxim=-1,s=0,st,dr,mij,cnt=0,ok=0,cs=0;
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v1[i];
s+=v1[i];
if(v1[i]>maxim)
maxim=v1[i];
}
st=maxim;
dr=s;
int j=0;
j=1;
s=0;
while(st<=dr)
{
mij=(st+dr)/2;
while(ok<=n)
{
if(s+v1[j]<mij)
{
s+=v1[j];
ok++;
}
else
{
cnt++;
cs=s;
s=0;
}
j++;
}
ok=0;
j=0;
if(cnt>k)
{
st=mij+1;
}
else
{
dr=mij-1;
}
}
mij=(dr+st)/2;
out<<mij;
return 0;
}