Submission

Compilation Error

Score: 0

User: devilpoohs

Problemset: เรียงสตริง

Language: cpp

Time: 0.000 second

Submitted On: 2024-11-26 05:59:12

#include<bits/stdc++.h>
using namespace std;
#define N INT_MAX
int a[N];
int dp[N];
int idk(int i){
    if(i==0){
        return 0 ;
    }
    if(dp[i]!=-1) return dp[i];
    int cost=N ;
    cost=min(cost,idk(i-1)+abs(a[i]-a[i-1])) ;
    if(i>1){
    cost=min(cost,idk(i-2)+abs(a[i]-a[i-2])) ;
    }
	dp[i]=cost ;
    return dp[i];
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n ;
    memset(dp,-1,sizeof(dp));
    cin>>n ;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    cout << idk(n-1) ;
    return 0;
}