Pagini recente » Cod sursa (job #2117963) | Cod sursa (job #1667327) | Istoria paginii runda/pre_oji_2011 | Cod sursa (job #533596) | Cod sursa (job #1830274)
#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,c,Max,st,dr,mij,v[16001],sum,nr,sol,i,s;
int main()
{
fin>>n>>k;
s=0;
for(i=1;i<=n;i++){
fin>>v[i];
s=s+v[i];
if(v[i]>Max)
Max=v[i];
}
st=Max;
dr=s;
while(st<=dr){
mij=(st+dr)/2;
sum=0;
nr=1;
for(i=1;i<=n;i++){
if(sum+v[i]<=mij)
sum=sum+v[i];
else{
nr++;
sum=v[i];
}
}
if(nr<=k){
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
fout<<sol;
}