Bridge and torch problem
Parameters
Travelling times:
Parsed: 1,2,5,8
Bridge capacity:
Algorithm:
Dynamic programming
Brute force
Greedy