Submission #1322451

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
using namespace std;
long long n, a[100004]; long long dp[200000];
int DP(int num) {
  if (dp[num] != -1) {
  //  cout << num << endl;
    return dp[num];
  }
  if (num > n-1) {
    return 10000000;
  }
  if (num == n-1) {
    return 0;
  }
  //cout << cost<<"a";
   return dp[num] = min(DP(num + 1) + abs(a[num] - a[num + 1]), DP(num + 2) + abs(a[num] - a[num + 2]));
}
 
int main()
{
  memset(a, 0, sizeof(a));
  memset(dp, -1, sizeof(dp));
  cin >> n;
  REP(i, n) {
    cin >> a[i];
  }
 
  cout << DP(0) << endl;
  return 0;
}

Submission Info

Judge Result