Cod sursa(job #2862821)
Utilizator | Data | 5 martie 2022 21:31:24 | |
---|---|---|---|
Problema | Oo | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int n,dp[100005],i,v[100005],Max;
int main()
{
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
}
dp[2] = v[1] + v[2];
dp[3] = v[2] + v[3];
Max = max(Max,dp[2]);
Max = max(Max,dp[3]);
for(i=4;i<=n;i++){
dp[i] = max(dp[i-3],dp[i-4]) + v[i] + v[i-1];
Max = max(Max,dp[i]);
}
fout << Max;
return 0;
}