173242025-06-26 18:40:1742thebestestSzigetek (35 pont)cpp17Accepted 35/3527ms1888 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, m; cin >> N;
    vector<int> arak, odaig;
    for (int i = 0; i < N; i++) {
        cin >> m;
        arak.push_back(m);
    }
    odaig.push_back(arak[0]);
    odaig.push_back(arak[1] + arak[0]);
    for (int j = 2; j < N;  j++) {
        odaig.push_back(min(odaig[j-1], odaig[j-2]) + arak[j]);
    }
    cout << odaig[N-1] << endl;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/027ms1708 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms408 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms564 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms500 KiB
11Accepted2/22ms316 KiB
12Accepted2/22ms316 KiB
13Accepted2/23ms532 KiB
14Accepted2/26ms700 KiB
15Accepted2/28ms824 KiB
16Accepted2/214ms996 KiB
17Accepted2/219ms1508 KiB
18Accepted2/221ms1708 KiB
19Accepted2/224ms1704 KiB
20Accepted2/224ms1708 KiB
21Accepted2/226ms1840 KiB
22Accepted2/227ms1888 KiB