코드#include #include #include #include #include #include using namespace std;typedef long long ll;const int MAX_N = 2000003;ll n, a[MAX_N];vector tree;void update(vector &tree, int idx, ll diff) { while(idx &tree, int idx) { ll ans = 0; while(idx > 0) { ans += tree[idx]; idx -= (idx & -idx); } return ans;}int find_kth(int x) { int s = 1; int e = MAX_N; while..
