dtwd886的博客

#include #include #include #define left L,m,rt<<1#define right m+1,R,rt<<1|1#define maxn 100050int flag;int sum[maxn<<2];void down(int rt){ if(sum[rt]) { sum[rt<<1]+=sum[rt]; sum[rt<<1|1]

#include #include #include #include #define maxn 200005using namespace std;int sum[maxn<<2];int col[maxn<<2];struct node{ int id,x;}a[maxn];int num[maxn/2][2];bool cmp(node X,node Y){ r

#include #include #include using namespace std;#define maxn 200010struct node{ int Max,Min; int flag;}num[maxn<<2];int P;void Down(int rt){ if(num[rt].flag) { num[rt<<1].Max+=num[rt].f

#include #include #include #include using namespace std;#define maxn 100010long long num[maxn<<2];void up(int rt){ num[rt]=num[rt<<1]+num[rt<<1|1];}void build(int L,int R,int rt){ if(L==R

#include #include #include using namespace std;#define left L,m,rt<<1#define right m+1,R,rt<<1|1 #define maxn 100010struct node{ int l1,l0; int r1,r0; int m1,m0; int flag; int l,r;}sum[m

#include #include #include #include #define maxn 160005#define LL long longusing namespace std;struct node{ LL x1,x2,y; LL c,v; node(long long x1=0,long long x2=0,long long y=0,long long c

#include #include #include #include using namespace std;#define maxn 10010struct node{ double x1,x2,y; int cover; node(double x1=0,double x2=0,double y=0,int cover=0):x1(x1),x2(x2),y(y),cove

#include #include #include #include using namespace std;#define maxn 100010struct node{ double x1,x2,y; int cover; node(double x1=0,double x2=0,double y=0,int cover=0):x1(x1),x2(x2),y(y),c

#include #include #include #include using namespace std;#define maxn 200010struct node{ int r,l,pos;}p[maxn];long long sum[maxn<<2];int visit[1000010];int a[50010];long long num[maxn];bo

#include #include #include #define maxn 50010using namespace std;struct { int l; //记录左边界 int r; //记录右边界 int rl,ll,ml; //左边开始的最大连续长度， //以及右边开始的连续最大长度，还有整个区间的最大连续长度 }SegTree[maxn<<2];int

#include #include #include using namespace std;#define LL long long#define left L,m,rt<<1#define right m+1,R,rt<<1|1LL num[200010];void update(int rt){ num[rt]=num[rt<<1]+num[rt<<1|1]; }vo