Cod sursa(job #142275)
Utilizator | Cazacu Alexandru katakuna | Data | 24 februarie 2008 13:12:51 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include<stdio.h>
int t,nr,n,k,i,min,max,p,u,mij,v[17000];
int main(){
FILE *f=fopen("transport.in","r");
fscanf(f,"%d %d",&n,&k);
for(i=1;i<=n;i++){
fscanf(f,"%d",&v[i]);
if(v[i]>min)
min=v[i];
max+=v[i];
}
fclose(f);
p=min;
u=max;
while(p<=u){
mij=(p+u)/2;
t=0;
nr=0;
for(i=1;i<=n;i++){
t+=v[i];
if(t>mij){
t=0;
nr++;
i--;
}
}
if(t!=0){
nr++;
t=0;
}
if(nr<=k)
u=mij-1;
else
p=mij+1;
}
FILE *g=fopen("transport.out","w");
fprintf(g,"%d",p);
fclose(g);
return 0;
}