hdu1166裸的线段树问题,就是一个简单的单点操作和求和操作 #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll MAXN = 5e5 + 7; ll pre[MAXN], tree[MAXN * 4], ans[MAXN]; string Ins[] = {"Add", "Sub", "Query", "End"}; void Buildtree(ll p, ll l, ll r) //建树 { i...