【HDOJ】4902 Nice boat

区间线段树。题目还不错。

 /*  */
 #include <iostream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <vector>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <cstring>
 #include <climits>
 #include <cctype>
 using namespace std;

 #define lson l, mid, rt<<1
 #define rson mid+1, r, rt<<1|1
 #define MAXN 100005

 typedef struct {
     int mx, val;
 } node_t;

 node_t T[MAXN<<];
 int n, m, x;
 int l;

 int gcd(int n, int m) {
     if (m == )
         return n;
     if (m > n)
         return gcd(m, n);
     return gcd(m, n%m);
 }

 void PushUp(int rt) {
     T[rt].val = T[rt<<].val==T[rt<<|].val ? T[rt<<].val:-;
     T[rt].mx = max(T[rt<<].mx, T[rt<<|].mx);
 }

 void PushDown(int rt) {
     if (T[rt].val >= ) {
         T[rt<<].val = T[rt<<|].val = T[rt].val;
         T[rt<<].mx = T[rt<<|].mx = T[rt].mx;
     }
 }

 void build(int l, int r, int rt) {
     if (l == r) {
         scanf("%d", &T[rt].val);
         T[rt].mx = T[rt].val;
         return ;
     }
     int mid = (l+r)>>;
     build(lson);
     build(rson);
     PushUp(rt);
 }

 void update1(int ll, int rr, int l, int r, int rt) {
     if (ll<=l && rr>=r) {
         T[rt].val = x;
         T[rt].mx = x;
         return ;
     }
     int mid = (l+r)>>;
     PushDown(rt);
     if (rr <= mid) {
         update1(ll, rr, lson);
     } else if (ll > mid) {
         update1(ll, rr, rson);
     } else {
         update1(ll, mid, lson);
         update1(mid+, rr, rson);
     }
     PushUp(rt);
 }

 void update2(int ll, int rr, int l, int r, int rt) {
     if (T[rt].mx <= x)
         return ;
     int mid = (l+r)>>;
     if (ll<=l && rr>=r) {
         if (T[rt].val >= ) {
             T[rt].val = gcd(T[rt].val, x);
             T[rt].mx = T[rt].val;
         } else {
             update2(ll, rr, lson);
             update2(ll, rr, rson);
             PushUp(rt);
         }
         return ;
     }
     PushDown(rt);
     if (rr <= mid) {
         update2(ll, rr, lson);
     } else if (ll > mid) {
         update2(ll, rr, rson);
     } else {
         update2(ll, mid, lson);
         update2(mid+, rr, rson);
     }
     PushUp(rt);
 }

 void printAll(int l, int r, int rt) {
     if (T[rt].val >= ) {
         for (int i=l; i<=r; ++i)
             printf("%d ", T[rt].val);
         return ;
     }
     int mid = (l+r)>>;
     printAll(lson);
     printAll(rson);
 }

 int main() {
     int i, j, k;
     int l, r;
     int t;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     scanf("%d", &t);
     while (t--) {
         scanf("%d", &n);
         build(, n, );
         scanf("%d", &m);
         while (m--) {
             scanf("%d %d %d %d", &k, &l, &r, &x);
             if (k == ) {
                 update1(l, r, , n, );
             } else {
                 update2(l, r, , n, );
             }
         }
         printAll(, n, );
         putchar('\n');
     }

     return ;
 }