DragonOne的博客

1.单点修改、区间查询 int lowbit(int x) { return x=x&(-x); } 单点修改 void update(int x,int num) { for(int i=x;i<=n;i+=lowbit(i)) C[i]+=num; } 区间查询 int getsum(int x) { int ans=0; for(int i=x;i;i-=lowbit(i)) ans+=C[i]; return ans； } 2.区间修改、单点查询 与

#define _CRT_SECURE_NO_DEPRECATE #include<iostream> #include<algorithm> #include<functional> #include<numeric> #include<string> #include<vector> #include<cstring> //memset #include<queue> using namespace std

int n, a[100]; int WPL() { priority_queue<int, vector<int>, greater<int> > q; for (int i = 0; i < n; i++) q.push(a[i]); int wpl = 0; while (q.size()>1) { int d1 = q.top(); q.pop();