CSP：卖菜

CSP：卖菜

原题链接

满分代码：

#include <iostream>

using namespace std;

int n;
int input[1001] = {0};
int output[1001] = {0};

int main()
{
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> input[i];
    }
    output[0] = (input[0] + input[1]) / 2;
    for (int i = 1; i < n - 1; ++i) {
        output[i] = (input[i - 1] + input[i] + input[i + 1]) / 3;
    }
    output[n - 1] = (input[n - 1] + input[n - 2]) / 2;
    cout<<output[0];
    for (int i = 1; i < n; ++i) {
        cout<< " " << output[i];
    }
    cout<<endl;
    return 0;
}