Submission #2526744

---

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;

int main(){
  int n; cin >> n;
  vector<long long> v;
  for (int i = 0; i < n; i++){
    long long k; cin >> k;
    v.push_back(k);
  }
  vector<long long> c;
  c.push_back(0);
  for (int i = 1; i < n; i++) {
  	long long x = 1e9; long long y = 1e9;
    x = c[i-1] + max(v[i] - v[i-1], v[i-1] - v[i]);
    if (i > 1) y = c[i-2] + max(v[i] - v[i-2], v[i-2] - v[i]);
    c.push_back(min(x, y));
  }
  cout << c.back() << endl;
  return 0;
}

Submission Info

Judge Result