ZZU_LGY

题目链接#include<bits/stdc++.h>using namespace std;const int N=100010;int a[N*2];map<int,int>M;struct Node{ int l; int r; int id;}node[N];int tr[N*2],res[N*2];int n,m;int lowbit(int x){ return x&-x;}void add(int x,

题目链接思路：作者：王清楚链接：https://ac.nowcoder.com/discuss/433576?type=101&order=0&pos=1&page=2&source_id=discuss_tag_nctrack&channel=-1&ncTraceId=5c213ab729f648e1a7a981f3d9bf1093.332.16412045509669960&gio_id=706E3F4A31A0A254549D383D844

题目链接#include<iostream>#include<cstring>#include<algorithm>#include<unordered_map>using namespace std;//#define int long longconst int N = 100010;int tr[N];int n,m;int lowbit(int x){ return x&-x;}void add(int x,i

题目链接#include <iostream>#include <cstring>#include <algorithm>using namespace std;#define int long longconst int N = 100010;int n,m;int a[N],tr1[N],tr2[N];int lowbit(int x){ return x&-x;}void add(int tr[],int x,int v)

题目链接#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 100010;#define int long longint tr[N],a[N],n,m;int lowbit(int x){ return x&-x;}void add(int x,int v){ for(int i=x;i&lt