modify code

Author: algorithmzuo

src/class182/Code05_MassChangeQueries1.java

@@ -31,8 +31,6 @@ public class Code05_MassChangeQueries1 {
 	public static int[] pool = new int[MAXT];
 	public static int top;
 
-	public static int[] ans = new int[MAXN];
-
 	public static void prepare() {
 		top = 0;
 		for (int i = 1; i < MAXT; i++) {
@@ -126,7 +124,7 @@ public static void dfs(int val, int l, int r, int i) {
 			return;
 		}
 		if (l == r) {
-			ans[l] = val;
+			arr[l] = val;
 		} else {
 			int mid = (l + r) >> 1;
 			dfs(val, l, mid, ls[i]);
@@ -159,7 +157,7 @@ public static void main(String[] args) throws Exception {
 			dfs(v, 1, n, root[v]);
 		}
 		for (int i = 1; i <= n; i++) {
-			out.print(ans[i] + " ");
+			out.print(arr[i] + " ");
 		}
 		out.flush();
 		out.close();

src/class182/Code05_MassChangeQueries2.java

@@ -29,8 +29,6 @@
 //int pool[MAXT];
 //int top;
 //
-//int ans[MAXN];
-//
 //void prepare() {
 //    top = 0;
 //    for (int i = 1; i < MAXT; i++) {
@@ -124,7 +122,7 @@
 //        return;
 //    }
 //    if (l == r) {
-//        ans[l] = val;
+//        arr[l] = val;
 //    } else {
 //        int mid = (l + r) >> 1;
 //        dfs(val, l, mid, ls[i]);
@@ -154,7 +152,7 @@
 //        dfs(v, 1, n, root[v]);
 //    }
 //    for (int i = 1; i <= n; i++) {
-//        cout << ans[i] << ' ';
+//        cout << arr[i] << ' ';
 //    }
 //    return 0;
 //}