Pagini recente » Cod sursa (job #559037) | Cod sursa (job #272788) | Cod sursa (job #2972575) | Cod sursa (job #380779) | Cod sursa (job #672626)
Cod sursa(job #672626)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
int n,a[100000],v[100000];
int main()
{
int i,max,s=0,j,p,t,nr;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<n;i++)
v[i]=a[i]+a[i+1];
v[n]=a[1]+a[n];
t=1;
while(t==1)
{
t=0;
max=0;
for(i=1;i<=n;i++)
if(max<v[i])
max=v[i],p=i;
s=s+max;
v[p]=0;
j=(p+1)%n;
v[j]=0;
j=(p+2)%n;
v[j]=0;
j=(p-1)%n;
v[j]=0;
for(i=1;i<=n;i++)
{
nr=0;
while(v[i])
i++, nr++;
if(nr>=2)
t=1, i=n+1;
if(v[1]!=0 && v[n] !=0)
t=1, i=n+1;
}
}
g<<s;
return 0;
}