77732024-01-11 09:28:001478Szigetek (35 pont)cpp17Accepted 35/3527ms6248 KiB
#include <bits/stdc++.h>  
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 
int main()
{
    //ifstream cin("in.txt");
    int n;
    cin >> n;
    vector<int> c(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> c[i];
    }
    vector<int> dp(n + 1);
    dp[1] = c[1];
    dp[2] = c[1] + c[2];

    for(int i = 3; i <= n; i++){
        dp[i] = min(dp[i - 1], dp[i - 2]) + c[i];
    }

    cout << dp[n];
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/03ms1960 KiB
2Accepted0/027ms3628 KiB
3Accepted1/13ms2496 KiB
4Accepted1/13ms2700 KiB
5Accepted1/13ms2880 KiB
6Accepted1/13ms3048 KiB
7Accepted1/13ms3268 KiB
8Accepted2/23ms3400 KiB
9Accepted2/23ms3596 KiB
10Accepted2/23ms3956 KiB
11Accepted2/24ms4100 KiB
12Accepted2/24ms4336 KiB
13Accepted2/24ms4616 KiB
14Accepted2/27ms4748 KiB
15Accepted2/29ms4908 KiB
16Accepted2/214ms5400 KiB
17Accepted2/219ms5508 KiB
18Accepted2/221ms5888 KiB
19Accepted2/224ms6148 KiB
20Accepted2/225ms6248 KiB
21Accepted2/226ms6232 KiB
22Accepted2/227ms6228 KiB