Submission #1308120

---

Source Code Expand

N = input()
a = map(int, raw_input().split())
dp = [-1 for i in range(N)]
def dfs(i):
    if i >= N:
        return 0
    elif i == N-1:
        return 0
    elif i == N-2:
        return abs(a[i+1] - a[i])
    elif dp[i] != -1:
        return dp[i]
    else:
        dp[i] = min(
            dfs(i+1) + abs(a[i+1] - a[i]),
            dfs(i+2) + abs(a[i+2] - a[i])
        )
        return dp[i]

print dfs(0)

Submission Info

Judge Result