Frog 1

Solution by augusto — 100 pts

Code / Notes

#include <bits/stdc++.h>
using namespace std;


int main() {
    int N;
    cin >> N;

    vector<int> h(N), dp(N);

    for (int i = 0; i < N; i++) {
        cin >> h[i];
    }

    dp[0] = 0;
    dp[1] = abs(h[1] - h[0]);

    for (int i = 2; i < N; i++) {
        int pulo1 = dp[i - 1] + abs(h[i] - h[i - 1]);
        int pulo2 = dp[i - 2] + abs(h[i] - h[i - 2]);

        dp[i] = min(pulo1, pulo2);
    }

    cout << dp[N - 1] << endl;
}

Last updated 1 month, 1 week ago

« Back to problem