/**
* author: milos
* created: 26.12.2020 00:20:30
**/
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> a;
/*#define MAX_VALUE 1000000000
int Secret(int X, int Y) {
return (X + 2 * (Y / 2) < MAX_VALUE) ? (X + 2 * (Y / 2)) : MAX_VALUE;
}*/
vector<pair<int, pair<vector<int>, vector<int>>>> ans;
int Query(int l, int r) {
for (auto c : ans) {
if (c.first >= l && c.first <= r) {
if (r == c.first) {
int j = c.first - l;
return c.second.first[j];
}
int j = c.first - l, z = r - c.first - 1;
return Secret(c.second.first[j], c.second.second[z]);
}
}
return 0;
}
void Solve(int l, int r) {
if (l > r) {
return;
}
int mid = (l + r) / 2;
vector<int> pref, suf;
int x = a[mid];
pref.push_back(x);
for (int i = mid - 1; i >= l; i--) {
x = Secret(a[i], x);
pref.push_back(x);
}
if (mid + 1 < (int) a.size()) {
x = a[mid + 1];
suf.push_back(x);
for (int i = mid + 2; i <= r; i++) {
x = Secret(x, a[i]);
suf.push_back(x);
}
}
ans.push_back({mid, {pref, suf}});
Solve(l, mid - 1);
Solve(mid + 1, r);
}
void Init(int N, int* A) {
for (int i = 0; i < N; i++) {
a.push_back(A[i]);
}
Solve(0, N - 1);
}
