Kemija

#include <iostream>
#include <algorithm>
#include <cstdlib>
#define F first
#define S second

using namespace std;

int n, a[101010], ans[101010];

int pos(int x){
    if(x >= n) return x-n;
    if(x < 0) return n-x;
    return x;
}

bool valid(int num, int pr){
    int ind = 0;

    for(int i=0; i<n; i++) ans[i] = 0;

    do{
        ans[ind] = num;
        if(ans[pos(ind-1)]+ans[ind]+ans[pos(ind+1)] > a[ind]) return 0;
        num += a[pos(ind+2)]-a[pos(ind+1)];
        ind = pos(ind+3);
    } while(ind);

    if(pr) for(int i=0; i<n; i++) cout << ans[i] << ' ';

    return 1;
}

int main(){

    cin >> n;

    for(int i=0; i<n; i++) cin >> a[i];

    int k=0;

    for(int b=1e9; b>=1; b/=2){
        while(valid(k+b, 0)) k+=b;
    }

    valid(k, 1);

    return 0;
}
/*/
6
9 6 9 12 15 12
/*/

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER