712A - Memory and Crow - CodeForces Solution

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

#define mp make_pair //(f, s);
#define F first
#define S second
#define pb push_back
#define sz(x) int(x.size())
#define all(x)  (x).begin(), (x).end()

const int inf = INT_MAX;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-8;

int n,a[maxn], b[maxn];


int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 0; i < n; i ++)
        cin >> a[i];
    b[n-1] = a[n-1];
    for(int i = n-2; i >= 0; i--)
    {
        b[i] = a[i] -(-1 * a[i+1]);
    }
    for(int i = 0; i < n; i ++)
        cout << b[i] << ' ';
    cout << endl;
}
/*
*/