Pagini recente » Borderou de evaluare (job #2913427) | Cod sursa (job #3229422) | Cod sursa (job #598088) | Cod sursa (job #427959) | Cod sursa (job #2181291)
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16001], n, k;
bool e_bun(int c) {
int nr=0, cc=0;
for (int i=0; i<n; i++) {
if (cc<v[i]) {
cc=c;
nr++;
}
if (cc<v[i]) {
return false;
}
if (nr>k) {
return false;
}
cc-=v[i];
}
return true;
}
int main() {
f>>n>>k;
for (int i=0; i<n; i++) {
f>>v[i];
}
int pas=1<<28, c=0;
while (pas!=0) {
if (e_bun(c)) {
c+=pas;
}
pas/=2;
}
g<<c+1;
return 0;
}