4878 | 2023. 04. 05 20:32:21 | CWM | Szigetek (35 pont) | cpp17 | Elfogadva 35/35 | 12ms | 5988 KiB |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <unordered_set>
//upper bound >
//lower bound >=
//int index = (lower_bound(testvec.begin(), testvec.end(), num)-testvec.begin());
using namespace std;
using ll = long long;
int mod = 1000000007;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> vec;
vector<int> least(n);
for (size_t i = 0; i < n; i++)
{
int a;
cin >> a;
vec.push_back(a);
}
least[0] = vec[0];
least[1] = vec[0] + vec[1];
for (size_t i = 2; i < n; i++)
{
least[i] = min(least[i - 2], least[i - 1]) + vec[i];
}
cout << least[n - 1];
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 35/35 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1832 KiB | |||
2 | Elfogadva | 0/0 | 12ms | 4064 KiB | |||
3 | Elfogadva | 1/1 | 3ms | 2236 KiB | |||
4 | Elfogadva | 1/1 | 3ms | 2440 KiB | |||
5 | Elfogadva | 1/1 | 2ms | 2656 KiB | |||
6 | Elfogadva | 1/1 | 3ms | 2884 KiB | |||
7 | Elfogadva | 1/1 | 2ms | 2972 KiB | |||
8 | Elfogadva | 2/2 | 3ms | 3088 KiB | |||
9 | Elfogadva | 2/2 | 3ms | 3456 KiB | |||
10 | Elfogadva | 2/2 | 3ms | 3428 KiB | |||
11 | Elfogadva | 2/2 | 3ms | 3428 KiB | |||
12 | Elfogadva | 2/2 | 3ms | 3756 KiB | |||
13 | Elfogadva | 2/2 | 3ms | 4240 KiB | |||
14 | Elfogadva | 2/2 | 4ms | 4304 KiB | |||
15 | Elfogadva | 2/2 | 6ms | 4620 KiB | |||
16 | Elfogadva | 2/2 | 7ms | 4976 KiB | |||
17 | Elfogadva | 2/2 | 8ms | 5700 KiB | |||
18 | Elfogadva | 2/2 | 9ms | 5780 KiB | |||
19 | Elfogadva | 2/2 | 10ms | 5956 KiB | |||
20 | Elfogadva | 2/2 | 10ms | 5944 KiB | |||
21 | Elfogadva | 2/2 | 12ms | 5988 KiB | |||
22 | Elfogadva | 2/2 | 12ms | 5984 KiB |