Pagini recente » Cod sursa (job #378531) | Cod sursa (job #1351626) | Cod sursa (job #106) | Cod sursa (job #3175613) | Cod sursa (job #157342)
Cod sursa(job #157342)
#include<stdio.h>
unsigned int n,o[10001],nr[10001];
FILE* f;
FILE* g;
int main()
{int i,j;unsigned long max,mx;
f=fopen("oo.in","r");
g=fopen("oo.out","w");
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++) fscanf(f,"%d",&o[i]);
//aduna din primele 2 sectoare
nr[1]=o[1]+o[2];
max=nr[1];
for(i=4;i<=n-2;i++)
{mx=0;
for(j=1;j<=i-3;j++)
if(mx<nr[j]) mx=nr[j];
nr[i]=o[i+1]+o[i]+mx;
if(nr[i]>max) max=nr[i];
}
for(i=1;i<=n;i++) nr[i]=0;
//aduna din sectoarele 2 si 3
nr[2]=o[2]+o[3];
for(i=5;i<=n-1;i++)
{mx=0;
for(j=1;j<=i-3;j++)
if(mx<nr[j]) mx=nr[j];
nr[i]=o[i+1]+o[i]+mx;
if(nr[i]>max) max=nr[i];
}
for(i=1;i<=n;i++) nr[i]=0;
//memset(nr,0,sizeof(nr));
//aduna din sectoarele 1 si n
nr[1]=o[1]+o[n];
nr[3]=nr[1]+o[3]+o[4];
for(i=4;i<=n-3;i++)
{mx=0;
for(j=1;j<=i-3;j++)
if(mx<nr[j]) mx=nr[j];
nr[i]=o[i+1]+o[i]+mx;
if(nr[i]>max) max=nr[i];
}
fprintf(g,"%ld",max);
fclose(g);
return 0;
}