Pagini recente » Cod sursa (job #840173) | Cod sursa (job #2087833) | Cod sursa (job #112400) | Cod sursa (job #1822657) | Cod sursa (job #1456110)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int N,K,A[16002],tot,sum,k=1,tmp,rs,x;
int main(){
fin >> N >> K;
for(int i = 0;i<N;i++){
fin >> A[i];
tot+=A[i];
}
rs = ceil((float)tot/K);
for(int i = 0;i<N;i++){
x+=A[i];
if(x > rs){
if(ceil((float)(tot-sum)/rs) > K-k){
tmp = 0;
for(int j = i;tmp < x && j<N;j++){
tmp+=A[j];
}
if(rs < tmp){
rs = min(tmp,x);
k = ceil((float)sum/rs);
}
}else{
k++;
x = A[i];
}
}
sum+=A[i];
}
fout << rs;
return 0;
}