코드#include #include #include using namespace std;typedef long long ll;int n,m,s,x,y;vector tree;vector a;void init(int node, int start, int end) { if (start == end) { tree[node] = a[start]; return; } else { int mid = (start + end) / 2; init(node*2, start, mid); init(node*2 + 1, mid + 1, end); tree[node] = tree[node*2] + tree[node*2 + 1]; }}ll query(int node, int start, int e..
