Pagini recente » Cod sursa (job #115439) | Cod sursa (job #930144) | Cod sursa (job #272649) | Cod sursa (job #2078759) | Cod sursa (job #2082764)
#include <iostream>
#include <fstream>
using namespace std;
int v[16005],n,k;
bool sepoate(int c)
{
int cc=c,nr=1;
for (int i=1;i<=n;i++)
{
if (v[i]>c) return false;
if (v[i]>cc)
{
nr++;
cc=c;
}
cc-=v[i];
if (nr>k)
{
return false;
}
}
return true;
}
int main()
{
ifstream in("transport.in");
ofstream out("transport.out");
in>>n>>k;
v[0]=0;
for (int i=1;i<=n;i++)
{
in>>v[i];
}
int r,pas;
r=0;
pas=1<<14;
while (pas!=0)
{
if (sepoate(pas+r)==false)
{
r+=pas;
}
pas/=2;
}
r++;
out<<r;
in.close();
out.close();
return 0;
}