Pagini recente » Cod sursa (job #2548146) | Cod sursa (job #1788882) | Cod sursa (job #1919976) | Cod sursa (job #2879189) | Cod sursa (job #1879025)
#include <fstream>
using namespace std;
int const NMAX=16000;
int v[NMAX+5];
ifstream cin("transport.in");
ofstream cout("transport.out");
int main()
{
int n,k,i,total=0,st,dr,med,last,tr;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
total+=v[i];
}
st=1;
dr=total;
last=0;
while(st<=dr)
{
med=(st+dr)/2;
///Calculam cate transpoturi sunt
///necesare pt a transporta toate saltelele
tr=0;int sum=0;
for(i=1;i<=n;i++)
{
if(v[i]>med)
{
tr=k+1;
break;
}
if(sum+v[i]<=med)
{
sum+=v[i];
}
else
{
tr++;
sum=v[i];
}
}
if(sum<=med)
tr++;
if(tr<=k)
{
last=med;
dr=med-1;
}
else st=med+1;
}
cout<<last;
cin.close();
cout.close();
return 0;
}