codeforces 444C DZY Loves Colors(线段树)
2015-01-21 20:17
387 查看
题意:[1, n] 中ai的有两个属性,颜色,累积和。定义两种操作,1:区间染色 2:区间查询。当一个点的颜色变化时,累积和 += abs(new - old)。。。
思路:
对线段树上每个节点维护三个属性, sum(和), color(颜色), sign(累积和)。。
pushdown:
如果当前节点上 sign 不为0 (区间修改的结果放在这个节点上,还没更新到子节点), sign[lc] += sign[o] ,sign[rc] += sign[o] 同时更新sum
如果当前节点上 color不为 -1 (连续的一段), color[lc] = color[rc] = color[o]
。。。。。
思路:
对线段树上每个节点维护三个属性, sum(和), color(颜色), sign(累积和)。。
pushdown:
如果当前节点上 sign 不为0 (区间修改的结果放在这个节点上,还没更新到子节点), sign[lc] += sign[o] ,sign[rc] += sign[o] 同时更新sum
如果当前节点上 color不为 -1 (连续的一段), color[lc] = color[rc] = color[o]
。。。。。
#include<bits/stdc++.h> using namespace std; #define SPEED_UP iostream::sync_with_stdio(false); #define FIXED_FLOAT cout.setf(ios::fixed, ios::floatfield); #define rep(i, s, t) for(int (i)=(s);(i)<=(t);++(i)) #define urep(i, s, t) for(int (i)=(s);(i)>=(t);--(i)) typedef long long LL; #define Maxn 100100 const int Maxnode = Maxn<<2; LL cor[Maxnode], sign[Maxnode], sum[Maxnode]; int n, m; #define lson(x) ((x)<<1) #define rson(x) (((x)<<1)+1) void segUp(int o, int L, int R) { int lc = lson(o), rc = rson(o), mid = (L+R)>>1; sum[o] = sum[lc] + sum[rc]; sign[o] = 0; if (cor[lc] == cor[rc]) cor[o] = cor[lc]; else cor[o] = -1; } void segDown(int o, int L, int R) { int lc = lson(o), rc = rson(o), mid = (L+R)>>1; if (sign[o]) { sum[lc] += 1ll*(mid-L+1)*sign[o]; sum[rc] += 1ll*(R-mid)*sign[o]; sign[lc] += sign[o]; sign[rc] += sign[o]; sign[o] = 0; } if (cor[o] != -1) { cor[lc] = cor[rc] = cor[o]; cor[o] = -1; } } void segUpdate(int o, int qL, int qR, int L, int R, int k) { if (qL <= L && R <= qR && cor[o] != -1) { sign[o] += abs(k-cor[o]); sum[o] += 1ll*(R-L+1)*abs(k-cor[o]); cor[o] = k; return; } segDown(o, L, R); int lc = lson(o), rc = rson(o), mid = (L+R)>>1; if (qL <= mid) segUpdate(lc, qL, qR, L, mid, k); if (qR > mid) segUpdate(rc, qL, qR, mid+1, R, k); segUp(o, L, R); } LL segQuery(int o, int qL, int qR, int L, int R) { if (qL <= L && R <= qR) { return sum[o]; } segDown(o, L, R); int lc = lson(o), rc = rson(o), mid = (L+R)>>1; LL ret = 0; if (qL <= mid) ret += segQuery(lc, qL, qR, L, mid); if (qR > mid) ret += segQuery(rc, qL, qR, mid+1, R); return ret; } void segBuild(int o, int L, int R) { if (L == R) { cor[o] = L; sign[o] = sum[o] = 0; return; } int mid = (L+R)>>1; segBuild(lson(o), L, mid); segBuild(rson(o), mid+1, R); segUp(o, L, R); } void init() { cin >> n >> m; segBuild(1, 1, n); } int maxNode = 0; void segPrint(int o, int L, int R) { maxNode = max(maxNode, o); cout << "Node " << o << "[" << L << ", " << R << "] cor: " << cor[o] << " sign: " << sign[o] << " sum: " << sum[o] << endl; if (L < R) { int mid = (L+R)>>1; segPrint(lson(o), L, mid); segPrint(rson(o), mid+1, R); } } int main() { #ifndef ONLINE_JUDGE freopen("input.in", "r", stdin); #endif SPEED_UP init(); int op, l, r, x; //segPrint(1, 1, n); //cout << "nodes count: " << maxNode << endl; rep(i, 1, m) { cin >> op; if (op == 1) { cin >> l >> r >> x; //cout << "Update: " << l << ", " << r << " to " << x << endl; segUpdate(1, l, r, 1, n, x); } else { cin >> l >> r; //cout << "Query: " << l << ", " << r << endl;; cout << segQuery(1, l, r, 1, n) << endl; } //segPrint(1, 1, n); } return 0; }
相关文章推荐
- Codeforces 444C DZY Loves Colors(线段树)
- Codeforces 444C DZY Loves Colors(线段树)
- 【CodeForces】444C DZY Loves Colors 线段树
- Codeforces 444C DZY Loves Colors 线段树
- codeforces 444C. DZY Loves Colors (线段树)
- CodeForces 444C - DZY Loves Colors(线段树)
- Codeforces 444C DZY Loves Colors 线段树
- Codeforces 444C DZY Loves Colors 线段树区间更新
- 【线段树】 codeforces 444C DZY Loves Colors
- Codeforces 444C DZY Loves Colors(线段树)
- Codeforces 444C DZY Loves Colors 水线段树
- codeforces 444 C. DZY Loves Colors(线段树)
- Cf 444C DZY Loves Colors(线段树)
- CodeForces 444C DZY Loves Colors
- codeforces 444C DZY Loves Colors
- Codeforces 444C DZY Loves Colors
- codeforces 444 C. DZY Loves Colors(线段树)
- [Codeforces Round #254 div1] C.DZY Loves Colors 【线段树】
- codeforces 445E - DZY Loves Colors
- Codeforces Round #254 (Div. 1)C. DZY Loves Colors(线段树经典操作/分块)