Pagini recente » Cod sursa (job #1819336) | Cod sursa (job #1939590) | Cod sursa (job #1085799) | Cod sursa (job #625910) | Cod sursa (job #671980)
Cod sursa(job #671980)
#include<istream>
#include<fstream>
using namespace std;
ifstream f("gaini.in");
ofstream g("gaini.out");
int c[100000],x[100000];
int main()
{
int n,i,j=0,s=0,max=0,t=1;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<n;i++)
{
c[i]=x[i]+x[i+1];
}
c[n]=x[1]+x[n];
while(t)
{
t=1;
for(i=1;i<=n;i++)
{
if(max<c[i])
{
max=c[i];
j=i;
}
}
s=s+max;
max=0;
c[j-1]=0;
c[j+1]=0;
if(max==0)
t=0;
}
g<<s;
return 0;
}