Cod sursa(job #3294889)
Utilizator | Data | 30 aprilie 2025 09:16:19 | |
---|---|---|---|
Problema | Oo | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <iostream>
using namespace std;
int v[200001],d[100001];
int main()
{
int n,i,s;
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
d[1]=v[1];
d[2]=v[1]+v[2];
v[0]=v[n];
for(i=3; i<n; i++)
{
s=v[i]+v[i-1];
d[i]=max(s+d[i-3], d[i-1]);
}
cout<<d[n-1];
return 0;
}