做法:
- 类似于逆序数的思想,我们把元素值作为索引加入树状数组。我们再query(x) 所得到就是[1,x] 元素的个数,也相当于这个元素在这个无序序列中的权重。
- 举个栗子:
- a[1] = 27 a[2] = 31 a[3] = 15 a[4] = 28
for(int i=1;i<=4;i++) update(a[i],1);
for(int i=1;i<=4;i++) cout<<query(a[i])<<endl; //输出结果为2 4 1 3 - 酱紫,如果我们在查询的时候,从1到最大的值 二分,找到第一个query(x) - query(a[i]) >=k 的x 就是答案
- 好题~
AC代码:
#include<bits/stdc++.h>
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb(x) push_back(x)
#define sz(x) (int)(x).size()
#define sc(x) scanf("%d",&x)
#define pr(x) printf("%d\n",x)
#define abs(x) ((x)<0 ? -(x) : x)
#define all(x) x.begin(),x.end()
#define mk(x,y) make_pair(x,y)
#define debug printf("!!!!!!\n")
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const double PI = 4*atan(1.0);
const int maxm = 1e8+5;
const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
inline int read()
{
char x;
int u,flag = 0;
while(x = getchar(),x<'0' || x>'9') if(x == '-') flag = 1;
u = x-'0';
while(x = getchar(),x>='0' && x<='9') u = (u<<3)+(u<<1)+x-'0';
if(flag) u = -u;
return u;
}
int n,m,sum;
int c[maxn];
inline int lowbit(int x){return x&(-x);}
void update(int x,int val)
{
for(int i=x;i<=maxn;i+=lowbit(i)) c[i]+=val;
}
int query(int x)
{
int res = 0;
for(int i=x;i;i-=lowbit(i)) res+=c[i];
return res;
}
int binary(int x,int k)
{
int l,r,mid;
l = x, r = maxn-1;
while(l<=r)
{
mid = ((r-l)>>1) + l;
if(query(mid)-sum>=k) r = mid-1; //当前所查找的元素是否与sum的差值>=k 如果==k就是代表
else l = mid+1; //该元素就是大于a的第k个数
}
return l;
}
int main()
{
#ifdef LOCAL_FILE
freopen("in.txt","r",stdin);
#endif // LOCAL_FILE
while(~scanf("%d",&n))
{
memset(c,0,sizeof(c));
int op,x,k;
while(n--)
{
op = read();
if(op == 0){
x = read();
update(x,1);
}
else if(op == 1){
x = read();
if(query(x)-query(x-1)) update(x,-1);
else printf("No Elment!\n");
}
else{
x = read();
k = read();
sum = query(x); //统计[1,x] 1的个数,sum相当于是x离散后所对应的值
int ans = binary(x,k);
if(ans!=maxn) printf("%d\n",ans);
else printf("Not Find!\n");
}
}
}
return 0;
}