growing_up_的博客

//离散化+线段树 #include #include #include #define CLR(A) memset(A,0,sizeof(A)) using namespace std; const int N = 20005; int col[N * 4], vis[N]; int le[N], ri[N], c[N * 2], ans; void pushdown(int p)

#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include using namespace std; const int maxn = 50005; int sum[maxn<<2]; void push_up(int root) { sum[root] = sum[root << 1] + sum

//区间修改，区间查询 #define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include #define ll long long using namespace std; const int maxn = 100005; struct node { ll sum; int lazy; }T[maxn<<

#include #include #include #include using namespace std; #define maxn 100000 + 10 #define lson L, mid, rt<<1 #define rson mid+1, R, rt<<1|1 int n, k; int a[maxn]; int ans; struct Node { int

#include #include #include #include #define ll long long using namespace std; const int N = 5010; int bit[N]; int n; void add(int i) { while (i <= n) { bit[i] += 1; i += (i&-i); } } int sum(i

//单点修改，区间查询 #define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include using namespace std; const int maxn = 50005; int sum[maxn<<2]; void push_up(int root) { sum[root] = sum[root

//区间修改，区间查询 #define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include #define ll long long using namespace std; const int maxn = 100005; struct node { ll sum; int lazy; }T[maxn<<