题解: 二分+树状数组 记录以下i在当前拍第几 代码: #include<bits/stdc++.h> using namespace std; ; int a[N],f1[N],f2[N],n,m,x,y,num[N]; int js(int x) { ; for (;x;x-=x&-x)ans+=num[x]; return ans; } void inster(int x,int y) { for (;x<=n;x+=x&-x)num[x]+=y; } int cm…