Pagini recente » Cod sursa (job #1657968) | Cod sursa (job #251344) | Cod sursa (job #2014212) | Cod sursa (job #1639366) | Cod sursa (job #2002415)
#include <fstream>
#define MAX 16002
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[MAX],cmax;
int main()
{
fin >> n >> k;
int lo=1;
for (int i=1;i<=n;i++)
{
fin >> v[i];
if (v[i]>lo)
lo=v[i];
}
int hi=0x3f3f3f3f,capmax=0;
int mi=lo+(hi-lo/2);
while (lo<=hi)
{
int nrop=1,s=0;
for (int i=1;i<=n;i++)
{
s+=v[i];
if (s>mi)
{
s=v[i];
nrop++;
}
if (nrop>k)
{
lo=mi+1;
mi=lo+(hi-lo)/2;
break;
}
}
if (nrop<=k)
{
capmax=mi;
hi=mi-1;
mi=lo+(hi-lo)/2;
}
}
fout << capmax;
return 0;
}