lyjvactor的专栏

#include#include#include#include#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int maxn = 200020;using namespace std;int p[200020],v[200020];int sum[maxn<<2];int ans[maxn];void build

对照着notonlysuccess大牛的代码写的

#include#include#include#include#include#include#define lson r,m,rt<<1#define rson m+1,r,rt<<1|1const int maxn=55555;using namespace std;int lsum[maxn<<2],rsum[rt<<2],sum[rt<<2];void pushUp

一两个月没写代码的确是手生的厉害，

参考自http://www.cnblogs.com/maqiang/archive/2012/05/02/2479760.html

http://www.notonlysuccess.com/index.php/segment-tree-complete/#include#include#include#include#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define maxn 2222222using namespace std;int a[maxn

参考自http://www.notonlysuccess.com/index.php/segment-tree-complete/

http://www.notonlysuccess.com/index.php/segment-tree-complete/#include#include#include#include#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1using namespace std;const int maxn=5555;int sum[ma

#include#include#include#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1using namespace std;const int maxn=222222;int seq[maxn<<2];int h,w;void pushUp(int rt){ seq[rt]=max(seq[rt<<1],seq

在刷线段树，参考自http://www.notonlysuccess.com/index.php/segment-tree-complete/

将e按从大到小排序，统计

时间复杂度为O(n)，参考：http://bbs.dlut.edu.cn/bbstcon.php?board=Competition&gid=23474#include#include#include#include#define maxn 2001000using namespace std;char s[maxn],st[maxn];int p[maxn];int cases=

#include#include#include#includeusing namespace std;int a[1300][1300];int s;int lowbit(int x){ return x&(-x);}void add(int x,int y,int d){ for(int i=x;i<=s;i+=lowbit(i)) for(int

求逆序数#include#include#include#includeusing namespace std;struct node{ int num; int pos;};node st[500010];int reflect[500010];int a[500010];int n;bool cmp(node a,node b){ return

因为y已经排好序了，用x坐标ji

#include#include#includelong long num[100010];using namespace std;struct st{ int l; int r; long long sum; long long a;} p[400100];void build(int t,int l,int r){ p[t].l=l;

暴力#include#include#includeusing namespace std;int main(){ int t=0,i=0; char s[10][12]; bool a[12][12]; memset(s,'\0',sizeof(s)); while(scanf("%s",s[i])!=EOF) { if(

#include#include#include#include#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1using namespace std;const int maxn=100100;int sum[maxn<<2],col[maxn<<2];void pushUP(int rt){ sum[rt]=sum[r

第一次没想到用位运算，不