提出 #814190

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<long> nodes(n+1);
	for (long i = 1; i <= n; i++) {
		cin >> nodes[i];
	}
	nodes[0] = 1000000;
	
	vector<long long> path(n+1);
	for (long i = 2; i <= n; i++) {
		path[i] = min(path[i-1] + abs(nodes[i-1]-nodes[i]), path[i-2] + abs(nodes[i-2]-nodes[i]));
	}
	cout << path[n] << endl;
	return 0;
}

提出情報

ジャッジ結果