i weighs crates[i]. A ferry makes one trip a day and takes the crates strictly in line order: it loads them one after another until the next crate would overload it, then sails. Crates cannot be reordered or skipped.
Find the smallest ferry capacity (an integer) that gets all the crates across in at most days days.crates=[4, 8, 2, 6, 5, 3], days=3 → 12
With capacity 12: day 1 carries 4 + 8, day 2 carries 2 + 6, day 3 carries 5 + 3. With 11 it takes four trips: 4 | 8 + 2 | 6 + 5 | 3.
crates=[7, 1, 1, 1], days=4 → 7
The heaviest crate weighs 7, so the ferry cannot be smaller, and with 7 two days are already enough.
crates=[3, 3, 3], days=1 → 9
Everything has to go in one trip: 3 + 3 + 3 = 9.
crates=[4, 8, 2, 6, 5, 3], days=3
12
Run checks the first 3 tests in your browser. Submit checks all 77 tests on the server, hidden ones included.