Submission #772056

---

Source Code Expand

#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>

using namespace std;

#define MAX_N 100000

int n;

int a[MAX_N];

int distabs(int b1, int b2){
	return abs(a[b1] - a[b2]);
}

int main(){
	cin >> n;

	for (int i = 0; i < n; i++){
		cin >> a[i];
	}
	int sum=0;
	for (int i = 0; i < n; i++){
		if (i < n - 3){
			if (abs(a[i] - a[i + 1]) + abs(a[i + 1] - a[i + 3])
		>abs(a[i] - a[i + 2]) + abs(a[i + 2] - a[i + 3])){
				sum += abs(a[i] - a[i + 2]) + abs(a[i + 2] - a[i + 3]);
			}
			else{
				sum += abs(a[i] - a[i + 1]) + abs(a[i + 1] - a[i + 3]);
			}
			i += 2;
		}else if (i < n - 2){
			if (abs(a[i] - a[i + 1])>abs(a[i] - a[i + 2])){
				sum += abs(a[i] - a[i + 2]);
				i++;
			}
			else{
				sum += abs(a[i] - a[i + 1]);
			}
		}
	}
	cout << sum << endl;

	return 0;
}

Submission Info

Judge Result