线段树解题报告

H Moving Points 题目链接:https://vjudge.net/contest/358745#problem/H 思路:树状数组维护,类似于树状数组求逆序对+思维(思维量很小) #include using namespace std; const int N = 2e5+9; typedef long long ll; struct node{ ll a,b; friend bool operator <(node a,node b){ return a.a<b.a; } }a[N]; ll b[N]; ll h[N]; l