Pagini recente » Cod sursa (job #2546811) | Cod sursa (job #3260781) | Cod sursa (job #2690059) | Cod sursa (job #3263561) | Cod sursa (job #2624797)
#include <iostream>
#include <fstream>
using namespace std;
const int nmax=16000;
const int vmax=16000;
int v[nmax+1];
int n,k;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
bool destul (int c)
{
int nr=0,r=0;
for (int i=0; i < n; i++)
{
if(v[i]>c)
{
return false;
}
if(v[i]>r)
{
nr++;
r=c;
}
r-=v[i];
}
return (nr<=k);
}
int main()
{
fin>>n>>k;
for(int i=0; i<n; i++)
{
fin>>v[i];
}
int st=1,dr=vmax*nmax;
while (st<dr) /// cautbin la care adaugam functia bool
{
int m=(st+dr)/2;
if (destul(m))
dr=m;
else
st=m+1;
}
fout<< st;
return 0;
}