Pagini recente » Cod sursa (job #2339165) | Cod sursa (job #1453272)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int N,t[100],s,K;
int Div(int low,int high){
cout<<low<<" "<<high<<endl;
int mid,nr,q;
mid=(high+low)/2;
if(low==mid);
return low;
q=0;nr=1;
for(int i=0;i<N;i++){
q+=t[i];
if(q+t[i+1]>=mid){
nr++;
q=0;
}
}
if(nr>K)
return Div(mid+1,high);
else
return Div(low,mid+1);
}
int main()
{
f>>N>>K;
s=0;
for(int i=0;i<N;i++){
f>>t[i];
s+=t[i];
}
g<<Div(s/K,s);
return 0;
}