Pagini recente » Cod sursa (job #2922505) | Cod sursa (job #499171) | Cod sursa (job #2530226) | Cod sursa (job #2359429) | Cod sursa (job #3158158)
#include <fstream>
#include <climits>
using namespace std;
int v[16001];
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int check(int nr,int n)
{
int camion=nr,parcurgeri=1;
for(int i=1; i<=n; i++)
{
if(camion>=v[i])
{
camion-=v[i];
}
else if (nr>=v[i])
{
parcurgeri++;
camion=nr-v[i];
}
else
{
return INT_MAX;
}
}
return parcurgeri;
}
int cautbin(int n,int k,int s)
{
int st=1,dr=s,lastmed;
while (st<=dr)
{
int med=(st+dr)/2;
int parcurgerimed=check(med,n);
if(parcurgerimed>k)
{
st=med+1;
}
else if (parcurgerimed<=k)
{
dr=med-1;
lastmed=med;
}
}
return lastmed;
}
int main()
{
int n,k,s=0;
fin>>n>>k;
for (int i=1; i<=n; i++)
{
fin>>v[i];
s+=v[i];
}
fout << cautbin(n,k,s);
return 0;
}