zxker

题目：数据范围大，交换相邻的的树，使有序解题说明：关键是知道，每个数交换的次数是其前面比它大的树的个数。用树状数组维护一下~AC代码：#include<iostream>#include<algorithm>#include<string.h>#include<map> using namespace std;typedef long lo...

题目链接解题说明：裸题模板ac代码：#include<iostream>#include<algorithm>#include<string>using namespace std;const int MAXN=1e5+10;typedef long long ll;ll s[MAXN<<2],col[MAXN<<2];vo...

解题说明：AC代码：#include<iostream>#include<algorithm>#include<string.h>using namespace std;const int MAXN=1e5+10;int c[MAXN],ans[MAXN],n;int get(int x){ int res=0; for(;x;x-=(x&amp...

题意说明：解题说明：~AC代码；#include<bits/stdc++.h>using namespace std;typedef long long ll;const int MAXN=2*1e5+10;int s[(MAXN<<2)+10],n,m,w,ans;void modify(int p,int l,int r,int x,int v){ i...

I Hate ItTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 93183    Accepted Submission(s): 35335Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当...

                                             Color itTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 1745    Accepted Submission(s): 524...