216112026-01-13 17:09:56algoproSzigetek (35 pont)cpp17Wrong answer 0/3525ms1076 KiB
// UUID: d9ff18af-0cf6-44d8-8553-b6baaa83d773
#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] = szigetek[0];
	dp[1] = 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/025ms1076 KiB
3Wrong answer0/11ms316 KiB
4Wrong answer0/11ms316 KiB
5Wrong answer0/11ms316 KiB
6Wrong answer0/11ms316 KiB
7Wrong answer0/11ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/22ms424 KiB
11Wrong answer0/22ms316 KiB
12Wrong answer0/22ms508 KiB
13Wrong answer0/23ms316 KiB
14Wrong answer0/24ms564 KiB
15Wrong answer0/28ms568 KiB
16Wrong answer0/213ms564 KiB
17Wrong answer0/217ms960 KiB
18Wrong answer0/219ms1060 KiB
19Wrong answer0/221ms1076 KiB
20Wrong answer0/221ms1076 KiB
21Wrong answer0/224ms1076 KiB
22Wrong answer0/224ms1076 KiB