Cod sursa(job #2422314)
Utilizator | Data | 18 mai 2019 13:11:51 | |
---|---|---|---|
Problema | Oo | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("oo.in");
ofstream out("oo.out");
int v[100001],d[100001][2];
int main()
{
int i,n;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
d[1][1]=v[1]+v[n];
for(i=2; i<=n-1; i++)
{
d[i][1]=max(max(d[i-2][0],d[i-3][0]),d[i-4][0])+v[i]+v[i-1];
d[i][0]=max(d[i-1][1],d[i-1][0]);
}
out<<max(d[n-1][1],d[n-1][0]);
return 0;
}