215992026-01-13 17:05:45algoproSzigetek (35 pont)cpp17Wrong answer 0/3526ms1192 KiB
// UUID: 9f0f1e8b-8cd7-48ad-ba29-a00b64f89299
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;

	vector <int> szigetek(n);
	vector <int> dp(n);

	for(int i = 0; i < n; i++)
		cin >> szigetek[i];

	dp[0] = 0;
	dp[1] = abs(szigetek[1] - szigetek[0]);

	for(int i = 2; i < n; i++)
	{
		dp[i] = min(dp[i - 1] + abs(szigetek[i] - szigetek[i - 1]), dp[i - 2] + abs(szigetek[i] - szigetek[i - 2]));
	}
	cout << dp[n - 1];
}
SubtaskSumTestVerdictTimeMemory
base0/35
1Wrong answer0/01ms500 KiB
2Wrong answer0/026ms1076 KiB
3Wrong answer0/11ms348 KiB
4Wrong answer0/11ms316 KiB
5Wrong answer0/11ms316 KiB
6Wrong answer0/11ms316 KiB
7Wrong answer0/11ms316 KiB
8Wrong answer0/22ms584 KiB
9Wrong answer0/22ms316 KiB
10Wrong answer0/22ms316 KiB
11Wrong answer0/22ms316 KiB
12Wrong answer0/22ms316 KiB
13Wrong answer0/23ms500 KiB
14Wrong answer0/26ms316 KiB
15Wrong answer0/28ms564 KiB
16Wrong answer0/213ms564 KiB
17Wrong answer0/217ms960 KiB
18Wrong answer0/220ms1052 KiB
19Wrong answer0/223ms1076 KiB
20Wrong answer0/223ms1116 KiB
21Wrong answer0/226ms1192 KiB
22Wrong answer0/226ms1192 KiB