Cod sursa(job #3208136)
Utilizator | Data | 27 februarie 2024 20:30:56 | |
---|---|---|---|
Problema | Oo | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
const int dim=1e5+5;
int n,a[dim],dp[dim];
int main(){
ifstream f("oo.in");
ofstream g("oo.out");
f>>n;
for(int i=1;i<=n;i++){
f>>a[i];
}
dp[2]=a[1]+a[2];
for(int i=3;i<=n;i++){
dp[i]=max({dp[i-1],dp[i-3]+a[i]+a[i-1],dp[i-2]});
}
g<<dp[n];
return 0;
}