Cod sursa(job #1574576)
| Utilizator | Data | 20 ianuarie 2016 17:59:38 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
# include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int mij,st,dr,s,maxim,n,k,v[16001],i,nr;
int nrtrans(int mij){
int nr=1;
int c=0;
for (i=1;i<=n;i++) {
if (c+v[i]<=mij) {
c+=v[i];
} else {
nr++;
c=v[i];
}
}
return nr;
}
int main () {
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
if(maxim<v[i])
maxim=v[i];
s=s+v[i];
}
st=maxim;
dr=s+1;
while(st<=dr){
mij=(st+dr)/2;
if(nrtrans(mij)<=k)
dr=mij-1;
else
st=mij+1;
}
fout<<st;
return 0;
}
