Pagini recente » Cod sursa (job #2987848) | Cod sursa (job #1128733) | Cod sursa (job #2723718) | Cod sursa (job #1503722) | Cod sursa (job #1734548)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16005], n, k;
bool isOK(int capacitate)
{
int cate = 0;
for(int i=1; i<=n; i++)
{
int cap = capacitate;
if(v[i]<=cap)
{
cate++;
while(v[i]<=cap)
{
cap -= v[i++];
}
i--;
}
else if(v[i]>capacitate)
return false;
else
i--,cate++;
}
if(cate<=k) return true;
return false;
}
int cb()
{
int st = 1, dr = 16000, m, last = -1;
while(st<=dr)
{
int m = (st+dr) / 2;
if( isOK(m) )
{
last = m;
dr = m - 1;
}
else
{
st = m + 1;
}
}
return last;
}
int main()
{
fin >> n >> k;
for(int i=1; i<=n; i++)
fin >> v[i];
fout << cb();
}