Pagini recente » Cod sursa (job #2402354) | Cod sursa (job #262798) | Cod sursa (job #100494) | Cod sursa (job #780447) | Cod sursa (job #2328362)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, a[16004];
void Read()
{
fin >> n >> k;
for(int i=1; i<=n; i++)
fin >> a[i];
}
int Cautbin()
{
int mij, st, dr, nr, cnt,i, vol;
st = 0;
dr = 16000;
while(st < dr)
{
mij = (st + dr)/2;
nr = mij;
cnt = 1;
for(i=1; i<=n; i++)
{
if(mij - a[i] >= 0)
{
if(nr - a[i] >= 0) nr -= a[i];
else if(nr - a[i] < 0 && mij - a[i] >= 0)
cnt++, nr = mij, i--;
}
else
{
cnt = k + 1;
break;
}
}
if(cnt > k) st = mij + 1;
else if(cnt < k) dr = mij - 1;
else if(cnt == k) vol = mij, dr = mij - 1;
}
return vol;
}
int main()
{
Read();
fout << Cautbin();
return 0;
}