Pagini recente » Cod sursa (job #1353226) | Cod sursa (job #1034272) | Cod sursa (job #398006) | Cod sursa (job #273684) | Cod sursa (job #113052)
Cod sursa(job #113052)
#include<fstream.h>
ifstream f("oo.in");
ofstream g("oo.out");
int n,a[100];
void citire()
{ f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
int max()
{ int m=a[1];
for(int i=2;i<=n;i++)
if(m<a[i]) m=a[i];
return m;
}
int poz(int m)
{ for(int i=1;i<=n;i++)
if(a[i]==m) return i;
}
int suma(int k)
{ int p=0;
if(a[k-1]>a[k+1]) { p=a[k]+a[k-1];
a[k-2]=a[k-1]=a[k]=a[k+1]=-1;
}
else { p=a[k]+a[k+1];
a[k-1]=a[k]=a[k+1]=a[k+2]=-1;
}
return p;
}
int main()
{ citire();
int s=0,k=n;
while(k>2)
{ s+=suma(poz(max()));
k-=4;
}
g<<s;
g.close();
f.close();
return 0;
}