Atcoder Educational DP Contest

A

每个点可以转移到后面的两个点。

AC Code

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)(1e9)
#define fir first
#define sec secondconst int N=1e5+9,M=(1<<23)+9;
const int MOD=998244353,base=251;
inline void chkmax(int &x,int y){x=x<y?y:x;}
inline void chkmin(int &x,int y){x=x<y?x:y;}
inline int lowbit(int x){return x&(-x);}
int qpow(int a,int b,int p){int ret=1;while(b){if(b&1) ret=ret*a%p;a=a*a%p;b>>=1;}return ret;
}int n,h[N],dp[N]; 
void Mian(){cin>>n;for(int i=1;i<=n;++i) cin>>h[i];for(int i=1;i<=n;++i) dp[i]=INF;dp[1]=0;for(int i=1;i<=n;++i){chkmin(dp[i+1],dp[i]+llabs(h[i+1]-h[i]));chkmin(dp[i+2],dp[i]+llabs(h[i+2]-h[i]));}cout<<dp[n];
}
void Mianclr(){}
signed main(){ios::sync_with_stdio(false);cin.tie(0); cout.tie(0);int T=1; //cin>>T;while(T--){Mian();Mianclr(); }
}