Candies

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
  int n;
  cin >> n;
  ll a[(int)1e5];
  for(int i = 0; i < n/2; ++i) {
    cin >> a[i];
  }
  for(int i = 0; i < n/2; ++i) {
    int x;
    cin >> x;
    a[i] -= x;
  }
  ll s = 0;
  for(int i = 0; i < n/2; ++i) {
    s += a[i];
  } 
  if(s % 2 == 1) {
    cout << "QAQ\n";
    return 0;
  }
  a[0] -= s/2;
  a[n/2 - 1] -= s/2;
  ll m = abs(s/2);
  for(int i = 0; i < n/2 - 1; ++i) {
    m += abs(a[i]);
    a[i + 1] += a[i];
  }
  cout << m << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: ACCEPTED