Submission #3811550

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
  ll n;cin>>n;
  ll a[n];for(ll i=0;i<n;i++)cin>>a[i];
  ll dp[n];
  dp[0]=0;
  dp[1]=abs(a[1]-a[0]);
  for(ll i=2;i<n;i++){
    ll b=abs(a[i]-a[i-2]);
    ll c=abs(a[i]-a[i-1]);
    dp[i]=min(dp[i-2]+b,dp[i-1]+c);
  }
  cout<<dp[n-1]<<endl;
}

Submission Info

Judge Result