线段树成段跟新个人总结

来源：互联网发布：java fastjson api 编辑：程序博客网时间：2024/05/21 11:02

1.成段更新 hdu1698 Just a Hook

#include <cstdio>#include <iostream>#include <algorithm>using namespace std; #define lson l , m , rt << 1#define rson m + 1 , r , rt << 1 | 1const int maxn = 111111;int h , w , n;int col[maxn<<2];int sum[maxn<<2];void PushUp(int rt) {sum[rt] = sum[rt<<1] + sum[rt<<1|1];}void PushDown(int rt,int m) {if (col[rt]) {col[rt<<1] = col[rt<<1|1] = col[rt];sum[rt<<1] = (m - (m >> 1)) * col[rt];sum[rt<<1|1] = (m >> 1) * col[rt];col[rt] = 0;}}void build(int l,int r,int rt) {col[rt] = 0;sum[rt] = 1;if (l == r) return ;int m = (l + r) >> 1;build(lson);build(rson);PushUp(rt);}void update(int L,int R,int c,int l,int r,int rt) {if (L <= l && r <= R) {col[rt] = c;sum[rt] = c * (r - l + 1);return ;}    PushDown(rt , r - l + 1);int m = (l + r) >> 1;if (L <= m) update(L , R , c , lson);if (R > m) update(L , R , c , rson);PushUp(rt);}int main() {int T , n , m;scanf("%d",&T);for (int cas = 1 ; cas <= T ; cas ++) {scanf("%d%d",&n,&m);     build(1 , n , 1);while (m --) {int a , b , c;scanf("%d%d%d",&a,&b,&c);update(a , b , c , 1 , n , 1);}printf("Case %d: The total value of the hook is %d.\n",cas , sum[1]);}getchar();getchar();getchar();return 0;}

2.成段更新 poj3468 A Simple Problem with Integers

#include <cstdio>#include <algorithm>using namespace std;#define LL long long#define lson l, m, rt<<1#define rson m+1, r, rt<<1|1const int maxn = 222222;LL sum[maxn<<2];LL add[maxn<<2];void pushup(int rt) {sum[rt] = sum[rt<<1] + sum[rt<<1|1];}void pushdown(int rt,int m) {if (add[rt]) {add[rt<<1] += add[rt];add[rt<<1|1] += add[rt];sum[rt<<1] += add[rt] * (m - (m >> 1));sum[rt<<1|1] += add[rt] * (m >> 1);add[rt] = 0;}}void build(int l,int r,int rt) {add[rt] = 0;if (l == r) {scanf("%lld",&sum[rt]);return ;}int m = (l + r) >> 1;build(lson);build(rson);pushup(rt);}void update(int L,int R,int c,int l,int r,int rt) {if (L <= l && r <= R) {add[rt] += c;sum[rt] += (LL)c * (r - l + 1);return ;}pushdown(rt , r - l + 1);int m = (l + r) >> 1;if (L <= m) update(L , R , c , lson);if (m < R) update(L , R , c , rson);pushup(rt);}LL query(int L,int R,int l,int r,int rt) {if (L <= l && r <= R) {return sum[rt];}pushdown(rt , r - l + 1);int m = (l + r) >> 1;LL ret = 0;if (L <= m) ret += query(L , R , lson);if (m < R) ret += query(L , R , rson);return ret;}int main(){    int q, n;    while(scanf("%d%d", &n, &q) != EOF)    {        build(1, n, 1);        while(q--)        {           char op[2];           int a, b, c;           scanf("%s", op);           if (op[0] == 'Q')            {    scanf("%d%d",&a,&b);    printf("%lld\n",query(a , b , 1 , n , 1));   } else            {    scanf("%d%d%d",&a,&b,&c);    update(a , b , c , 1 , n , 1);   }        }    }     return 0;}

3.成段更新 poj2528 Mayor’s posters

#include <cstring>#include <cstdio>#include <algorithm>using namespace std;#define lson l, m, rt<<1#define rson m+1, r, rt<<1|1const int maxn = 11111;int X[maxn*3];bool hash[maxn];int li[maxn], ri[maxn];int col[maxn<<4];int ans;////////void pushdown(int rt){     if(col[rt] != -1)     {         col[rt<<1] = col[rt<<1|1] = col[rt];         col[rt] = -1;     }}void update(int L, int R, int c, int l ,int r, int rt){     if(L <= l && r <= R)     {          col[rt] = c;          return;     }     pushdown(rt);     int m = (l+r) >>1;     if(L <= m) update(L, R, c, lson);     if(m < R) update(L, R, c, rson); }void query(int l, int r, int rt){     if(col[rt] != -1)     {         if(!hash[col[rt]]) ans++;         hash[col[rt]] = true;         return;     }     if(l == r) return;     int m = (l+r)>>1;     query(lson);     query(rson);} int bin(int key, int n, int X[]){    int l = 0, r = n-1;    while(l <= r)    {        int m = (l+r) >>1;        if(X[m] == key) return m;        if(X[m] < key) l = m+1;        else r = m-1;    }    return -1;}//////int main() {int T , n;scanf("%d",&T);while (T --) {scanf("%d",&n);int nn = 0;for (int i = 0 ; i < n ; i ++) {scanf("%d%d",&li[i] , &ri[i]);X[nn++] = li[i];X[nn++] = ri[i];}sort(X , X + nn);int m = 1;for (int i = 1 ; i < nn; i ++) {if (X[i] != X[i-1]) X[m ++] = X[i];}for (int i = m - 1 ; i > 0 ; i --) {if (X[i] != X[i-1] + 1) X[m ++] = X[i-1] + 1;}sort(X , X + m);memset(col , -1 , sizeof(col));for (int i = 0 ; i < n ; i ++) {int l = bin(li[i] , m , X);int r = bin(ri[i] , m , X);update(l , r , i , 0 , m , 1);}ans = 0;memset(hash , false , sizeof(hash));query(0 , m , 1);printf("%d\n",ans);}return 0;}

4.成段更新 poj3225 Help with Intervals

#include <iostream>#include <cmath>#include <cstring>#include <cstdio>#include <algorithm>#define LL long long#define abs(x)     ((x)>0?(x):-(x))#define mset(a, b) memset(a, b, sizeof(a))#define rep(i, n)  for(int i = 0; i < n; i++)using namespace std;const int maxn = 131072;bool hash[max+1];int cover[maxn<<2];int XOR[maxn<<2];void FOR(int rt){     if(cover[rt] != -1) cover[rt] ^= 1;     else XOR[rt] ^= 1;}void pushdown[int rt]{     if(cover[rt] != -1)     {          cover[rt<<1] = cover[rt<<1|1]  = cover[rt];          XOR[rt<<1] = XOR[rt<<1|1]  = 0;          cover[rt] = -1;     }     if(XOR[rt])     {          FOR(rt<<1);          FOR(rt<<1|1);          XOR[rt] = 0;     }}void update(char op, int L, int R, int l, int r, int rt){     if(L <= l && r <= R)     {          if(op == 'U')           {                cover[rt] = 1;                XOR[rt] = 0;          else if(op == 'D')           {               cover[rt] = 0;               XOR[rt] = 0;          }          else if(op = 'S'|| op == 'C')          {               FOR[rt];          }          return;     }     pushdown[rt];     int m = (r+l) >> 1;     if(L <= m) update(op, L ,R, lson);     else if(op == 'I' || op == 'C' )     {          XOR[rt<<1] = cover[rt<<1] = 0;     }     if(m < R) update(op, L, R, rson);     else if(op == 'I' || op == 'C')     {          XOR[rt<<1|1] = cover[rt<<1|1] = 0;     }}void query(int l, int r, int rt){     if(cover[rt] == 1)     {         for(int it  = l, it <= r; it++)            hash[it] = true;         return;              }else if(cover[rt] == 0) return;     if(l == r) return;     pushdown(rt);     int m = (l + r)>>1;     query(lson);     query(rson);}int main(){    cover[1] = XOR[1] = 0;    char op, l ,r;    int a, b;    while(scanf("%c%c%d,%d%c\n", &op, &l, &a, &b, &r) != EOF)    {         a<<= 1; b <<=1;         if(l == '(') a++;         if(r == ')') b--;         if(a > b)         {              if(op == 'C' || op == 'I')                     cover[1] = XOR[rt] = 0;         }else update(op, a, b, 0, maxn, 1);             }    query(0, maxn, 1);    bool flag = false;    int s = -1, e;    for(int i = 0; i < maxn; i++)    {            if(hash[i])            {                       if(s == )            }    }    return 0;}