Pagini recente » Cod sursa (job #557775) | Cod sursa (job #2873490) | Cod sursa (job #429332) | Cod sursa (job #2494888) | Cod sursa (job #2695782)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,maxim,suma;
int v[16005];
bool Verificare(int x)
{
//verifica daca camionul cu capacitate x poate duce toate saltelele in k transporturi
int suma=0;
int t=0;
for(int i=1; i<=n; i++)
{
if(suma+v[i]<=x)
suma+=v[i];
else
{
suma=v[i];
t++;
if(t>k)
return 0;
}
}
if(t+1>k)
return 0;
return 1;
}
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>v[i], maxim=max(maxim,v[i]), suma+=v[i];
int st=maxim, dr=suma, sol=0;
while(st<=dr)
{
int mij=(st+dr)/2;
if(Verificare(mij))
sol=mij, dr=mij-1;
else
st=mij+1;
}
fout<<sol;
return 0;
}