Submission #1793935

---

Source Code Expand

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

int main(){
  int n;
  cin >> n;
  int a[n], dp[n];
  dp[0] = 0;
  for(int i=0;i<n;i++){
    cin >> a[i];
  }
  dp[1] = abs(a[0] - a[1]);
  for(int i=2;i<n;i++){
    int x1, x2;
    x1 = dp[i-1] + abs(a[i] - a[i-1]);
    x2 = dp[i-2] + abs(a[i] - a[i-2]);
    dp[i] = min(x1, x2);
  }
  cout << dp[n-1] << endl;
  return 0;
}

Submission Info

Judge Result