Pagini recente » Cod sursa (job #2479367) | Cod sursa (job #2089844) | Cod sursa (job #2568997) | Cod sursa (job #2107673) | Cod sursa (job #1247008)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f ("transport.in");
ofstream g ("transport.out");
int n, k, stiva[16005];
int greedy(unsigned int g)
{
int kfals = k;
unsigned int x;
for (int i = 0; i < n; i++)
{
x += stiva[i];
if (x >= g)
{
kfals--;
x = stiva[i];
}
}
if (kfals >= 0)
return 1;
else
return 0;
}
void caut(unsigned int st, unsigned int dr)
{cout << st << " " << dr << "\n";
if (st < dr)
{
unsigned int mij = (st + dr) / 2;
if (greedy(mij))
{
caut(st, mij - 1);
}
else
{
caut(mij + 1, dr);
}
}
else
{
g << st;
}
}
int main()
{
unsigned int st = 0, dr = 0;
f >> n >> k;
for (int i = 0; i < n; i++)
{
f >> stiva[i];
if (stiva[i] > st)
st = stiva[i];
dr += stiva[i];
}
caut(st, dr);
return 0;
}