236472026-01-27 07:41:27AkosVagyokEmborSzigetek (35 pont)cpp17Accepted 35/3526ms1584 KiB
#include <bits/stdc++.h>
using namespace std;
vector <int> t, aLenyeg, os;
int n;
void be(){
    cin>>n;
    t.resize(n+1);
    os.resize(n+1);
    aLenyeg.resize(n+1);
    for (int i=1; i<=n; i++){
        cin>>t[i];
        aLenyeg[i]=t[i];
    }

}
void fo(){
    for (int i=1; i<=n; i++){
        if (i>1){
            aLenyeg[i]=t[i]+aLenyeg[i-1];
            os[i]=i-1;
            if (i>2){
                if (aLenyeg[i]>t[i]+aLenyeg[i-2]){
                    aLenyeg[i]=t[i]+aLenyeg[i-2];
                    os[i]=i-2;
                }
            }
        }
    }
}
int main()
{
    be();
    fo();
    cout<<aLenyeg[n];
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/026ms1332 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms508 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms336 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms508 KiB
11Accepted2/22ms412 KiB
12Accepted2/22ms680 KiB
13Accepted2/23ms520 KiB
14Accepted2/26ms628 KiB
15Accepted2/28ms564 KiB
16Accepted2/213ms1008 KiB
17Accepted2/217ms1076 KiB
18Accepted2/219ms1332 KiB
19Accepted2/221ms1444 KiB
20Accepted2/223ms1332 KiB
21Accepted2/225ms1332 KiB
22Accepted2/226ms1584 KiB