Pagini recente » Cod sursa (job #703244) | Cod sursa (job #3186887) | Cod sursa (job #1361719) | Cod sursa (job #351774) | Cod sursa (job #2071921)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 16000;
ifstream in("transport.in");
ofstream out("transport.out");
int v[NMAX+5];
int main()
{
int n,k,sum=0,Max=-1;
in >> n >> k;
for (int i = 1; i<=n; i++)
{
in >> v[i];
Max = max(Max,v[i]);
sum+=v[i];
}
int st = Max, dr = sum, mj, cnt, mx,Min;
while (st<=dr)
{
mx = 0;
mj = (st+dr)/2;
cnt = 1;
sum = 0;
for (int i = 1; i<=n; i++)
{
if (sum+v[i]>mj)
{
cnt++;
mx = max(mx,sum);
sum = 0;
}
sum+=v[i];
}
if (cnt>k)
st = mj+1;
else
{
dr = mj-1;
Min = mx;
}
}
out << Min;
}