Pagini recente » Borderou de evaluare (job #1414394) | Cod sursa (job #2447781) | Cod sursa (job #920287) | Cod sursa (job #514263) | Cod sursa (job #2041726)
#include <iostream>
#include <fstream>
using namespace std;
int v[100001],s[100001];
int n,rez;
ifstream fin("oo.in");
ofstream fout("oo.out");
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(i>=2)
{
s[i]=v[i-1]+v[i];
}
}
s[1]=v[1]+v[n];
if(s[1] > s[2] && s[1] >s[n])rez+=s[1];
for(int i=2;i<=n-1;i++)
{
if( s[i] > s[i-1] && s[i] > s[i+1])
{
rez+=s[i];
i++;
}
}
fout<<rez;
return 0;
}