Super Frog Jump — Fibonacci

Problem

A super frog starts on platform 1 of N platforms. It can jump 1, 2, or 3 platforms forward. The cost is the absolute height difference.

Some platforms are broken (height = −1) — the frog cannot land on them!

Find the minimum total cost to reach platform N.

🧠 DP Concept

This extends Frog Jump with two new challenges:

1. Three jump options instead of two: check dp[i−1], dp[i−2], AND dp[i−3].
2. Broken platforms: if height[i] = −1, skip that platform (don't update dp[i]).

Also check that the source platform isn't broken and that i−j ≥ 1 before reading dp[i−j].

Recurrence: dp[i] = min over j∈{1,2,3} of (dp[i−j] + |h[i]−h[i−j]|), skipping broken sources.

Input Variables (pre-loaded)

💡 Height −1 means broken (💀). Use if height ≠ −1 to skip broken platforms.

Your Output

Result

—

Run your program to see the result.

Execution Log

Ready. Press ▶ Run to start.

Expected Answer

Answer:

Hint