Cod sursa(job #1453273)
Utilizator | Data | 23 iunie 2015 10:12:06 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#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==high);
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;
}