Pagini recente » Cod sursa (job #1322381) | Cod sursa (job #1076272) | Cod sursa (job #2245482) | Cod sursa (job #1164002) | Cod sursa (job #2979288)
#include <fstream>
using namespace std;
int n, k, i, v[16001], st, dr, m, s, t, sol;
int main()
{
ifstream f("transport.in");
f >> n >> k;
for (; i<n; ++i)
{
f >> v[i];
if (v[i]>st)
st = v[i];
dr+=v[i];
}
f.close();
while (st<=dr)
{
m = (st+dr)/2;
t = 1;
s = 0;
for (i=0; i<n; ++i)
if (s+v[i]<=m)
s += v[i];
else
{
t++;
s = 0;
}
if (t <= k)
{
sol = t;
dr = m-1;
}
else
st = m+1;
}
ofstream g("transport.out");
g << sol;
g.close();
return 0;
}