Pagini recente » Cod sursa (job #1547519) | Cod sursa (job #1748224) | Cod sursa (job #1582656) | Cod sursa (job #966238) | Cod sursa (job #1247040)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f ("transport.in");
ofstream g ("transport.out");
int n, k, stiva[16005];
unsigned int rez;
int greedy(unsigned int g)
{
int kfals = 0;
unsigned int x = 0;
for (int i = 0; i < n; i++)
{
x += stiva[i];
if (x > g)
{
kfals++;
x = stiva[i];
}
}
if (x > 0)
kfals++;
return kfals;
}
void caut(unsigned int st, unsigned int dr)
{
if (st <= dr)
{
unsigned int mij = (st + dr) / 2;
int grez = greedy(mij);
if (grez > k)
{
caut(mij + 1, dr);
}
else
{
rez = mij;
caut(st, mij - 1);
}
}
else
{
g << rez;
}
}
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;
}