Cod sursa(job #816347)
| Utilizator | Data | 17 noiembrie 2012 12:33:08 | |
|---|---|---|---|
| Problema | Transport | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.77 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
int n,k,v[16010],i,j,l1=0,l2=0,m,nr,s;
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1;i<=n;i++){
f>>v[i];
if(v[i]>l1)l1=v[i];
l2=l2+v[i];
}
l1--;
l2++;
while(l1<=l2){
m=(l1+l2)/2;
nr=0;
s=0;
for(i=1;i<=n;i++){
s=s+v[i];
if(s==m){
nr++;
s=0;
}
if(s>m){
nr++;
i--;
s=0;
}
}
if(s!=0)nr++;
cout<<m<<" "<<nr<<endl;
if(nr<=k)l2=m-1;
else l1=m+1;
}
g<<m;
return 0;
}
