Pagini recente » Cod sursa (job #2887592) | Cod sursa (job #2451288) | Cod sursa (job #1383572) | Cod sursa (job #1632843) | Cod sursa (job #3174498)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
short int v[16001];
int main()
{
int n, k, i, drm, mij, dr, st, mini=-1, sum=0, cc=0, x;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
sum+=v[i];
if(v[i]>mini)
mini=v[i];
}
st=mini;
dr=sum;
// cout<<st<<endl<<dr;
while(st<=dr)
{
mij=(st+dr)/2;
x=drm=0;
i=1;
while(i<=n)
{
x+=v[i];
if(x>mij)
{
drm++;
x=v[i];
}
i++;
}
drm++;
// cout<<mij<<" "<<drm<<" ";
if(drm>k)
st=mij+1;
else
{
dr=mij-1;
cc=mij;
}
// cout<<cc<<endl;
}
cout<<cc;
return 0;
}