Submission #2530217

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;

using namespace std;

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

    vector<int> d(N);
    d[0] = 0;
    d[1] = abs(a[1]-a[0]);
    for (int i = 2; i < N; i++){
	int x = d[i-2]+abs(a[i]-a[i-2]);
	int y = d[i-1]+abs(a[i]-a[i-1]);
	d[i] = min(x, y);
    }

    cout << d[N-1] << endl;

    return 0;
}

Submission Info

Judge Result