Pagini recente » Cod sursa (job #1920364) | Cod sursa (job #2895897) | Cod sursa (job #607078) | Cod sursa (job #1792826) | Cod sursa (job #560920)
Cod sursa(job #560920)
#include <fstream>
using namespace std;
fstream f("transport.in",ios::in);
fstream g("transport.out",ios::out);
long long n,k,k1,i,v[20000],min1,t,m,nr,max1,s;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++){
f>>v[i];
k1=k1+v[i];
if(v[i]>max1){max1=v[i];}
}
min1=16001;
while(max1<=k1){
m=(max1+k1)/2; nr=0;
for(i=1;i<=n; )
{
s=0;
while(s+v[i]<=m&&i<=n){
s+=v[i];i++;
}
nr++;
}
if(nr>k){max1=m+1;}
else{
if(nr<=k){
min1=m;k1=m-1;
} } }
g<<min1;
return 0;
}