Cod sursa(job #227154)
Utilizator | Data | 3 decembrie 2008 20:42:44 | |
---|---|---|---|
Problema | Oo | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <stdio.h>
long n,i,a[100000],max,st,p1[100000],p2[100000],s[100000],k;
int main()
{
freopen("oo.in","r",stdin);
freopen("oo.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
k=1;
s[1]=a[1]+a[n];
p1[1]=1;
p2[1]=n;
for(i=1;i<=n-1;i++)
{
k=k+1;
s[k]=a[i]+a[i+1];
p1[k]=i;
p2[k]=i+1;
}
printf("%d",st);
return 0;
}