text: A Dynamic Programming based solution to find min cost to reach station N - 1 from station 0.
code: #include <iostream> NEW_LINE #include <climits> NEW_LINE using namespace std ; #define INF  INT_MAX NEW_LINE #define N  4