Cod sursa(job #794464)
Utilizator | Alghisi Alessandro Paolo alexalghisi | Data | 6 octombrie 2012 13:10:21 |
---|---|---|---|
Problema | Oo | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int dp[200005];
int v[200005];
int main()
{
int n;
ifstream f("oo.in");
ofstream g("oo.out");
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
v[2*1]=v[i];
/* if(i==1)
{
dp[i]=v[i];
dp[n+1]=v[i];
}*/
// dp[i]=v[i]+v[i-1]+dp[i-3];
}
dp[1]=v[1];
dp[2]=dp[1]+v[2];
for(int i=3;i<=2*n;i++)
dp[i]=max(dp[i-1],v[i]+v[i-1]+dp[i-3]);
g<<*max_element(dp+1,dp+2*n+1);
return 0;
}