modify code

Author: algorithmzuo

src/class182/Code05_MassChangeQueries1.java

@@ -26,7 +26,7 @@ public class Code05_MassChangeQueries1 {
 	public static int[] root = new int[MAXV + 1];
 	public static int[] ls = new int[MAXT];
 	public static int[] rs = new int[MAXT];
-	public static int[] sum = new int[MAXT];
+	public static boolean[] status = new boolean[MAXT];
 
 	public static int[] pool = new int[MAXT];
 	public static int top;
@@ -46,11 +46,11 @@ public static void del(int i) {
 		pool[++top] = i;
 		ls[i] = 0;
 		rs[i] = 0;
-		sum[i] = 0;
+		status[i] = false;
 	}
 
 	public static void up(int i) {
-		sum[i] = sum[ls[i]] + sum[rs[i]];
+		status[i] = status[ls[i]] | status[rs[i]];
 	}
 
 	public static int insert(int jobi, int l, int r, int i) {
@@ -59,7 +59,7 @@ public static int insert(int jobi, int l, int r, int i) {
 			rt = newNode();
 		}
 		if (l == r) {
-			sum[rt]++;
+			status[rt] = true;
 		} else {
 			int mid = (l + r) >> 1;
 			if (jobi <= mid) {
@@ -77,7 +77,7 @@ public static int merge(int l, int r, int t1, int t2) {
 			return t1 + t2;
 		}
 		if (l == r) {
-			sum[t1] += sum[t2];
+			status[t1] |= status[t2];
 		} else {
 			int mid = (l + r) >> 1;
 			ls[t1] = merge(l, mid, ls[t1], ls[t2]);
@@ -120,7 +120,7 @@ public static void split(int jobl, int jobr, int l, int r, int t1) {
 	}
 
 	public static void dfs(int val, int l, int r, int i) {
-		if (i == 0 || sum[i] == 0) {
+		if (i == 0 || !status[i]) {
 			return;
 		}
 		if (l == r) {

src/class182/Code05_MassChangeQueries2.java

@@ -24,7 +24,7 @@
 //int root[MAXV + 1];
 //int ls[MAXT];
 //int rs[MAXT];
-//int sum[MAXT];
+//bool status[MAXT];
 //
 //int pool[MAXT];
 //int top;
@@ -44,11 +44,11 @@
 //    pool[++top] = i;
 //    ls[i] = 0;
 //    rs[i] = 0;
-//    sum[i] = 0;
+//    status[i] = false;
 //}
 //
 //void up(int i) {
-//    sum[i] = sum[ls[i]] + sum[rs[i]];
+//    status[i] = status[ls[i]] | status[rs[i]];
 //}
 //
 //int insert(int jobi, int l, int r, int i) {
@@ -57,7 +57,7 @@
 //        rt = newNode();
 //    }
 //    if (l == r) {
-//        sum[rt]++;
+//        status[rt] = true;
 //    } else {
 //        int mid = (l + r) >> 1;
 //        if (jobi <= mid) {
@@ -75,7 +75,7 @@
 //        return t1 + t2;
 //    }
 //    if (l == r) {
-//        sum[t1] += sum[t2];
+//        status[t1] |= status[t2];
 //    } else {
 //        int mid = (l + r) >> 1;
 //        ls[t1] = merge(l, mid, ls[t1], ls[t2]);
@@ -118,7 +118,7 @@
 //}
 //
 //void dfs(int val, int l, int r, int i) {
-//    if (i == 0 || sum[i] == 0) {
+//    if (i == 0 || !status[i]) {
 //        return;
 //    }
 //    if (l == r) {