Pagini recente » Clasament pre106 | Cod sursa (job #606008) | Cod sursa (job #11129) | Cod sursa (job #347953) | Cod sursa (job #2423894)
#include<fstream>
#include<cstdio>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16001];
int main()
{
int n, i, k, maxim, s, st, dr, pp, m, x, drum, cap;
cin>>n>>k;\
maxim=0;
s=0;
for(i=1; i<=n; i++)
{
cin>>v[i];
if(maxim < v[i])
maxim=v[i];
s+=v[i];
}
st=maxim;
dr=s;
while(st<=dr && pp==0)
{
m=(st+dr)/2;
drum=0;
for(x=1; x<=n; x++)
{
s=0;
while(m-s>=v[x] && x<=n)
{
s+=v[x];
x++;
}
drum++;
x--;
}
if(drum==k)
{
cap=m;
dr=m-1;
}
else
if(drum > k)
st=m+1;
else
dr=m-1;
}
cout<<cap;
return 0;
}