Pagini recente » Borderou de evaluare (job #1796718) | Borderou de evaluare (job #698935) | Cod sursa (job #2921125) | Borderou de evaluare (job #691801) | Cod sursa (job #2554227)
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); fin.tie(0); fout.tie(0);
#define PLEC fin.close(); fout.close(); return 0;
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, v[20000], st, dr(4e8), mid, res;
inline bool Check(int x)
{
int t(0), cnt(0);
for (int i = 1; i <= n; ++i)
{
if (t + v[i] > x)
t = 0, ++cnt;
t += v[i];
}
if (t) ++cnt;
return (cnt <= k);
}
int main()
{
DAU
fin >> n >> k;
for (int i = 1; i <= n; ++i)
fin >> v[i], st = max(st, v[i]);
while (st <= dr)
{
mid = (st + dr) / 2;
if (Check(mid))
res = mid, dr = mid - 1;
else st = mid + 1;
}
fout << res;
PLEC
}