Pagini recente » Cod sursa (job #1885306) | Cod sursa (job #2225698) | Cod sursa (job #1169514) | Cod sursa (job #336851) | Cod sursa (job #2181296)
#include <iostream>
#include <fstream>
using namespace std;
const int L= 28;
int n,k,v[L];
bool ok(int c)
{
int nr=0,cc=0;
for (int i=0; i<n; i++)
{
if (cc<v[i])
{
cc=c;
nr++;
}
if(cc<v[i])
{
return false;
}
if (nr>k)
{
return false;
}
cc-=v[i];
}
return true;
}
int caut2()
{
int r=0,pas=1<<L;
while (pas!=0)
{
if (!(ok(r+pas)))
{
r+=pas;
}
pas/=2;
}
r++;
return r;
}
int main()
{
ifstream in("transport.in");
ofstream out("transport.out");
int i;
in>>n>>k;
for (i=1; i<=n; i++)
in>>v[i];
out<<caut2()+1;
return 0;
}