Pagini recente » Cod sursa (job #2287803) | Cod sursa (job #804001) | Cod sursa (job #971522) | Cod sursa (job #67259) | Cod sursa (job #2225630)
#include <iostream>
#include <fstream>
using namespace std;
int v[16007];
ifstream f("transport.in");
ofstream g("transport.out");
int main()
{
int n,k,mx,s,scur,i,kk,l=0;
mx=s=0;
f>>n>>k;
for(int i=0;i<n;i++) {
f>>v[i];
if(v[i]>mx)
mx=v[i];
s+=v[i];
}
while(mx<=s) {
l=(mx+s)/2;
kk=1;
scur=0;
for(i=0;i<n;i++) {
if(scur+v[i]>l) {
kk++;
scur=v[i];
}
else
scur+=v[i];
}
if(kk<=k)
s=l-1;
else
mx=l+1;
}
g<<mx<<'\n';
f.close();
g.close();
return 0;
}