Cod sursa(job #2044838)
Utilizator | Data | 21 octombrie 2017 15:01:22 | |
---|---|---|---|
Problema | Oo | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
int x[100001],v[100001];
int main()
{
int n,i;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
v[2]=x[1]+x[2];
for(i=3;i<=n-1;i++)
v[i]=max(v[i-1],v[i-3]+x[i]+x[i-1]);
int maxx=v[n-1];
for(i=1;i<=n;i++)
v[i]=0;
v[3]=x[2]+x[3];
for(i=4;i<=n;i++)
v[i]=max(v[i-1],v[i-3]+x[i]+x[i-1]);
g<<max(maxx,v[n]);
return 0;
}