Score : 100 points
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
Find the minimum possible total cost incurred before the frog reaches Stone N.
Input is given from Standard Input in the following format:
N h_1 h_2 \ldots h_N
Print the minimum possible total cost incurred.
4 10 30 40 20
30
If we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.
2 10 10
0
If we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.
6 30 10 60 10 60 50
40
If we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.