Pagini recente » Cod sursa (job #602430) | Cod sursa (job #1871434) | Cod sursa (job #398392) | Cod sursa (job #1210295) | Cod sursa (job #2548214)
#include <iostream>
#include <fstream>
using namespace std;
ifstream r("transport.in");
ofstream w("transport.out");
int v[16003], n, k;
int verificare(int vmin)
{
int s = 0, cnt = 1;
for (int i = 1; i <= n; i++)
{
if (v[i] > vmin)
{
return 0;
}
if (s + v[i] <= vmin)
{
s += v[i];
}
else
{
cnt++;
s = v[i];
}
}
return (cnt <= k);
}
int CautBin()
{
int st, dr, mij;
st = 1;
dr = 16000*16000;
while (st <= dr)
{
mij = (st + dr) / 2;
if (verificare(mij) == 1)
{
dr = mij - 1;
}
else st = mij + 1;
}
return mij;
}
int main()
{
r>>n>>k;
for (int i = 1; i <= n; i++)
{
r>>v[i];
}
w<<CautBin();
return 0;
}