Cod sursa(job #1133117)
Utilizator | Cristian Osiac osiaccr | Data | 4 martie 2014 14:25:49 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int sol,mij,dr,st,Max,s,n,k,cop,i,v[16001],nr;
int main(){
f>>n;
f>>k;
sol=0;
Max=-99999999 ;
for(i=1;i<=n;i++){
f>>v[i];
s=s+v[i];
if(Max<v[i])
Max=v[i];
}
st=Max;
dr=s;
while(st<=dr){
mij=(st+dr)/2;
cop=mij;
nr=1;
s=v[1];
for(i=2;i<=n;i++){
if(s+v[i]<=cop)
s=s+v[i];
else{
nr++;
s=v[i];
}
}
if(nr<=k){
sol=cop;
dr=mij-1;
}
else
st=mij+1;
}
g<<sol;
return 0;
}