Title:	Budget Travel
Source:	Spanish Site #00222
Classification:	Dynamic Programming
Problem Notes:	Simple linear dynamic programming
Technical Notes:	Array manipulation
Solution:	Consider the following question: Assuming that I've just filled up (and bought a snack) from this station, what's the minimum additional cost it will take for me to get to my destination. Calculate this value, and store it in a lookup table, (to avoid redundancy).
Solution Code:	Gilbert Lee