Cod sursa(job #1212725)
Utilizator | Data | 25 iulie 2014 18:17:13 | |
---|---|---|---|
Problema | Oo | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int a[100005],dp[100005],i,rs,n;
int main()
{
ifstream cin("oo.in");
ofstream cout("oo.out");
cin>>n;
for(i=1;i<=n;++i) cin>>a[i];
for(i=2;i<=n;++i)
if(i<3) dp[i]=max(dp[i-1],a[i]+a[i-1]),rs=max(rs,dp[i]);
else dp[i]=max(dp[i-1],dp[i-3]+a[i]+a[i-1]),rs=max(rs,dp[i]);
cout<<rs<<'\n';
return 0;
}