#include<stdio.h>
#include<string.h>
int main(){
int n, i;
scanf("%d", &n);
int vegetable[2][n+1];
memset(vegetable, 0, sizeof(vegetable));
for(i=1; i<=n; i++) scanf("%d", &vegetable[0][i]);
for(i=2; i<n; i++)
vegetable[1][i] = (vegetable[0][i-1]+vegetable[0][i]+vegetable[0][i+1])/3;
vegetable[1][1] = (vegetable[0][1]+vegetable[0][2])/2;
vegetable[1][n] = (vegetable[0][n-1]+vegetable[0][n])/2;
for(i=1; i<=n; i++) printf("%d ", vegetable[1][i]);
return 0;
}
太久以前的题都太简单没有做的必要了吗?