Pagini recente » Cod sursa (job #2726622) | Cod sursa (job #3264434) | Cod sursa (job #644646) | Cod sursa (job #2155905) | Cod sursa (job #2972008)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,maxim,s,st,dr,v[16001],mij,k,sol;
int main()
{
fin>>n>>k;
maxim=INT_MIN;
for(int i=1;i<=n;i++)
{
fin>>v[i];
s+=v[i];
if(v[i]>maxim)
maxim=v[i];
}
st=maxim;
dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
int nr=1;
s=0;
for(int i=1;i<=n;i++)
{
if(s+v[i]<=mij)
s+=v[i];
else
{
nr++;
s=v[i];
}
}
if(nr<=k)
{
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
fout<<sol;
return 0;
}