modify code

Author: algorithmzuo

src/class174/Code03_ColorfulWorld1.java

@@ -26,18 +26,24 @@ public class Code03_ColorfulWorld1 {
 	public static int MAXV = 100002;
 	public static int n, m;
 	public static int blen, bnum;
-	public static int maxv, lazy;
 
 	public static int[] arr = new int[MAXN];
 	public static int[] op = new int[MAXM];
 	public static int[] ql = new int[MAXM];
 	public static int[] qr = new int[MAXM];
 	public static int[] qx = new int[MAXM];
 
+	// maxv代表一个序列块中的最大值
+	// lazy代表一个序列块中，所有数字需要统计减去多少
+	// fa代表值域并查集
+	// pre0代表数组前缀上0的词频统计
+	// cntv代表一个序列块中每种值的词频统计
+	public static int maxv, lazy;
 	public static int[] fa = new int[MAXV];
 	public static int[] pre0 = new int[MAXN];
 	public static int[] cntv = new int[MAXV];
 
+	// 查询的答案
 	public static int[] ans = new int[MAXM];
 
 	public static int find(int x) {

src/class174/Code03_ColorfulWorld2.java

@@ -20,14 +20,14 @@
 //const int MAXV = 100002;
 //int n, m;
 //int blen, bnum;
-//int maxv, lazy;
 //
 //int arr[MAXN];
 //int op[MAXM];
 //int ql[MAXM];
 //int qr[MAXM];
 //int qx[MAXM];
 //
+//int maxv, lazy;
 //int fa[MAXV];
 //int pre0[MAXN];
 //int cntv[MAXV];