Submission #3405230

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
    using namespace std;

ll dp[100010],a[100010];

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

Submission Info

Judge Result