Pagini recente » Cod sursa (job #1845949) | Cod sursa (job #897790) | Cod sursa (job #1575564) | Cod sursa (job #2425244) | Cod sursa (job #1558068)
#include <fstream>
#include <iostream>
#include <cstring>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
const int MAX = 100005;
int a[MAX];
int D[MAX];
int N;
int max1, max2, max3;
int maxim;
void Read();
void Solve();
int main()
{
Read();
Solve();
fin.close();
fout.close();
return 0;
}
void Read()
{
int i;
fin >> N;
for ( i = 1; i <= N; i++ )
{
fin >> a[i];
//cout << i << ' ' << a[i]; cin.get();
}
}
void Solve()
{
int i, j;
maxim = 0;
for ( i = 2; i <= N; i++ )
{
if ( i > 3 )
maxim = max( maxim, D[i - 3] );
D[i] = maxim + a[i] + a[i - 1];
if ( D[i] > max1 ) max1 = D[i];
//cout << D[i]; cin.get();
}
fout << max( max( max1, max2 ), max3 );
}