Submission #3011874

---

Source Code Expand

import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		long[] tks=new long[N];
		long[] cost=new long[N];

		for(int i=0; i<N; i++) {
			tks[i]=sc.nextLong();
			cost[i]=0;
		}
		cost[0]=0;
		cost[1]=Math.abs(tks[0]-tks[1]);

		for(int i=2; i<N; i++) {
			cost[i]=Math.min(cost[i-1]+Math.abs(tks[i]-tks[i-1]), cost[i-2]+Math.abs(tks[i]-tks[i-2]));
		}
		System.out.println(cost[N-1]);
	}
}

Submission Info

Judge Result