Minimum fee to traverse courses with jumps and switching penalty
Filed under Directi
The question
Given two courses A and B with N sub-courses each having associated fees, find the minimum fee to reach A[N] or B[N] from start. You can make forward jumps up to length K within the same course, or switch between courses with an additional penalty P.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.