Pagini recente » Cod sursa (job #129588) | Rating Daniel Afanasiuc (Afanasiuc_Daniel) | Cod sursa (job #1660969) | Cod sursa (job #2699631) | Cod sursa (job #2790828)
#include <fstream>
#include <algorithm>
#include <climits>;
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16005],i,l=1,r=256000,mid,sol;
int nrTrans(int c)
{
int sum=v[1],cnt=1;
for(i=2;i<=n;i++)
{
if(sum+v[i]<=c)
{
sum+=v[i];
}
else
{
sum=v[i];
cnt++;
}
}
return cnt;
}
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
l=max(l, v[i]);
}
while(l<=r)
{
mid=(l+r)/2;
if(nrTrans(mid)>k)
{
l=mid+1;
}
else
{
sol=mid;
r=mid-1;
}
}
fout<<sol;
return 0;
}