Pagini recente » Cod sursa (job #1410987) | Cod sursa (job #2098900) | Cod sursa (job #1889575) | Cod sursa (job #2557229) | Cod sursa (job #2181270)
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16001], n, k;
bool e_bun(int c){
int s, trans=0, curent=0;
for (int i=0; i<n; i++){
s+=v[i];
if (s>c){
if (curent==0){
return false;
}
else{
trans++;
s=0;
curent=0;
}
}
curent++;
}
if (trans>k){
return false;
}
return true;
}
int main() {
f>>n>>k;
for (int i=0; i<n; i++){
f>>v[i];
}
int pas=1<<14, c=0;
while (pas!=0){
if (pas+c<=n && !e_bun(c)){
c+=pas;
}
pas/=2;
}
g<<c+pas*2;
return 0;
}