Cod sursa(job #1503999)
| Utilizator | Data | 17 octombrie 2015 10:53:18 | |
|---|---|---|---|
| Problema | Oo | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
const int nmax=100005;
int dinamica[nmax],val[nmax];
int i,n,ras;
int main()
{
f>>n;
for (i=1;i<=n;i++)
f>>val[i];
for (i=2;i<n;i++)
dinamica[i]=max(val[i]+val[i-1]+dinamica[max(i-3,0)],dinamica[i-1]);
ras=dinamica[n-1];
for (i=1;i<=n;i++)
dinamica[i]=0;
for (i=3;i<=n;i++)
dinamica[i]=max(val[i]+val[i-1]+dinamica[max(i-3,0)],dinamica[i-1]);
g<<max(ras,dinamica[n]);
return 0;
}
