코드#include #include using namespace std;typedef long long ll;const int MAX_SIZE = 100003;int n, a[MAX_SIZE], m, i, r, x, l;vector odd, even;void update(vector &tree, int idx, int diff) { while(idx &tree, int idx) { int ans = 0; while(idx > 0) { ans += tree[idx]; idx -= (idx & -idx); } return ans;}void FASTIO() { ios_base::sync_with_stdio(false); cin.tie(NULL);..
