Pagini recente » Cod sursa (job #2764380) | Cod sursa (job #2863807) | Cod sursa (job #32027) | Cod sursa (job #2797775) | Cod sursa (job #2427636)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in") ;
ofstream out("transport.out") ;
const int NMAX = 16000;
int v[NMAX] , n , k;
bool incap (int c)
{
int nrt = 0 ,cc = 0 ;
for (int i = 0 ; i < n ; i++)
{
if (v[i] > c)
{
return false;
}
if (v[i]>cc)
{
nrt++;
cc=c;
}
cc -= v[i];
}
return(nrt <= k);
}
int main()
{
in >> n >> k;
for (int i = 0 ; i < n ; i++)
{
in >> v[i];
}
int r = 0 , pas = 1<<27;
while (pas!=0)
{
if (!incap(r+pas))
{
r += pas;
}
pas /= 2;
}
out << r+1;
return 0;
}