modify code

Author: algorithmzuo

src/class182/Code04_SegmentTreeSplit1.java

@@ -30,7 +30,7 @@ public class Code04_SegmentTreeSplit1 {
 	public static int[] ls = new int[MAXT];
 	public static int[] rs = new int[MAXT];
 	public static long[] sum = new long[MAXT];
-	public static int cntRoot;
+	public static int version;
 
 	public static int[] pool = new int[MAXT];
 	public static int top;
@@ -162,10 +162,10 @@ public static void main(String[] args) throws Exception {
 		prepare();
 		n = in.nextInt();
 		m = in.nextInt();
-		cntRoot = 1;
+		version = 1;
 		for (int i = 1, x; i <= n; i++) {
 			x = in.nextInt();
-			root[cntRoot] = add(i, x, 1, n, root[1]);
+			root[version] = add(i, x, 1, n, root[1]);
 		}
 		for (int i = 1, op, x, y, z; i <= m; i++) {
 			op = in.nextInt();
@@ -175,7 +175,7 @@ public static void main(String[] args) throws Exception {
 				z = in.nextInt();
 				split(y, z, 1, n, root[x]);
 				root[x] = tree1;
-				root[++cntRoot] = tree2;
+				root[++version] = tree2;
 			} else if (op == 1) {
 				x = in.nextInt();
 				y = in.nextInt();

src/class182/Code04_SegmentTreeSplit2.java

@@ -25,7 +25,7 @@
 //int ls[MAXT];
 //int rs[MAXT];
 //long long sum[MAXT];
-//int cntRoot;
+//int version;
 //
 //int pool[MAXT];
 //int top;
@@ -156,18 +156,18 @@
 //    cin.tie(nullptr);
 //    prepare();
 //    cin >> n >> m;
-//    cntRoot = 1;
+//    version = 1;
 //    for (int i = 1, x; i <= n; i++) {
 //        cin >> x;
-//        root[cntRoot] = add(i, x, 1, n, root[1]);
+//        root[version] = add(i, x, 1, n, root[1]);
 //    }
 //    for (int i = 1, op, x, y, z; i <= m; i++) {
 //        cin >> op;
 //        if (op == 0) {
 //            cin >> x >> y >> z;
 //            split(y, z, 1, n, root[x]);
 //            root[x] = tree1;
-//            root[++cntRoot] = tree2;
+//            root[++version] = tree2;
 //        } else if (op == 1) {
 //            cin >> x >> y;
 //            root[x] = merge(1, n, root[x], root[y]);