Pagini recente » Cod sursa (job #44220) | Cod sursa (job #1177687) | Cod sursa (job #731604) | Cod sursa (job #1410604) | Cod sursa (job #2528704)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int a[16005], n, m;
int Test(int c)
{
int s = 0, cnt = 1;
for (int i = 1; i <= n; i++)
{
if (a[i] > c)
return 0;
if (s + a[i] <= c)
s += a[i];
else
{
s = a[i];
cnt++;
}
}
return (cnt <= m);
}
int CB()
{
int st, dr, mij, p;
st = 1; dr = 256000000;
p = 1;
while (st <= dr)
{
mij = (st + dr) / 2;
if (Test(mij) == 1)
{
p = mij;
dr = mij - 1;
}
else st = mij + 1;
}
return p;
}
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i++)
fin >> a[i];
fout << CB();
return 0;
}