modify code

Author: algorithmzuo

src/class183/Code01_CentroidDecomposition1.java

@@ -27,7 +27,7 @@ public class Code01_CentroidDecomposition1 {
 
 	public static boolean[] vis = new boolean[MAXN];
 	public static int[] siz = new int[MAXN];
-	public static int[] maxp = new int[MAXN];
+	public static int[] maxPart = new int[MAXN];
 	public static int centroid;
 
 	public static int[] dis = new int[MAXN];
@@ -49,17 +49,17 @@ public static void addEdge(int u, int v, int w) {
 	// 找重心递归版，java会爆栈，C++可以通过
 	public static void getCentroid1(int u, int fa) {
 		siz[u] = 1;
-		maxp[u] = 0;
+		maxPart[u] = 0;
 		for (int e = head[u]; e > 0; e = nxt[e]) {
 			int v = to[e];
 			if (v != fa && !vis[v]) {
 				getCentroid1(v, u);
 				siz[u] += siz[v];
-				maxp[u] = Math.max(siz[v], maxp[u]);
+				maxPart[u] = Math.max(siz[v], maxPart[u]);
 			}
 		}
-		maxp[u] = Math.max(maxp[u], total - siz[u]);
-		if (maxp[u] < maxp[centroid]) {
+		maxPart[u] = Math.max(maxPart[u], total - siz[u]);
+		if (maxPart[u] < maxPart[centroid]) {
 			centroid = u;
 		}
 	}
@@ -90,7 +90,7 @@ public static void getCentroid2(int cur, int fa) {
 			pop();
 			if (e == -1) {
 				siz[u] = 1;
-				maxp[u] = 0;
+				maxPart[u] = 0;
 				e = head[u];
 			} else {
 				e = nxt[e];
@@ -106,11 +106,11 @@ public static void getCentroid2(int cur, int fa) {
 					int v = to[ei];
 					if (v != f && !vis[v]) {
 						siz[u] += siz[v];
-						maxp[u] = Math.max(siz[v], maxp[u]);
+						maxPart[u] = Math.max(siz[v], maxPart[u]);
 					}
 				}
-				maxp[u] = Math.max(maxp[u], total - siz[u]);
-				if (maxp[u] < maxp[centroid]) {
+				maxPart[u] = Math.max(maxPart[u], total - siz[u]);
+				if (maxPart[u] < maxPart[centroid]) {
 					centroid = u;
 				}
 			}
@@ -164,7 +164,7 @@ public static void compute(int u) {
 			if (!vis[v]) {
 				total = siz[v];
 				centroid = 0;
-				maxp[centroid] = n;
+				maxPart[centroid] = n;
 				// getCentroid1(v, u);
 				getCentroid2(v, u);
 				compute(centroid);
@@ -189,7 +189,7 @@ public static void main(String[] args) throws Exception {
 		}
 		total = n;
 		centroid = 0;
-		maxp[centroid] = n;
+		maxPart[centroid] = n;
 		// getCentroid1(1, 0);
 		getCentroid2(1, 0);
 		compute(centroid);

src/class183/Code01_CentroidDecomposition2.java

@@ -22,7 +22,7 @@
 //
 //bool vis[MAXN];
 //int siz[MAXN];
-//int maxp[MAXN];
+//int maxPart[MAXN];
 //int centroid;
 //
 //int dis[MAXN];
@@ -43,17 +43,17 @@
 //
 //void getCentroid(int u, int fa) {
 //    siz[u] = 1;
-//    maxp[u] = 0;
+//    maxPart[u] = 0;
 //    for (int e = head[u]; e > 0; e = nxt[e]) {
 //        int v = to[e];
 //        if (v != fa && !vis[v]) {
 //            getCentroid(v, u);
 //            siz[u] += siz[v];
-//            maxp[u] = max(maxp[u], siz[v]);
+//            maxPart[u] = max(maxPart[u], siz[v]);
 //        }
 //    }
-//    maxp[u] = max(maxp[u], total - siz[u]);
-//    if (maxp[u] < maxp[centroid]) {
+//    maxPart[u] = max(maxPart[u], total - siz[u]);
+//    if (maxPart[u] < maxPart[centroid]) {
 //        centroid = u;
 //    }
 //}
@@ -105,7 +105,7 @@
 //        if (!vis[v]) {
 //            total = siz[v];
 //            centroid = 0;
-//            maxp[centroid] = n;
+//            maxPart[centroid] = n;
 //            getCentroid(v, u);
 //            compute(centroid);
 //        }
@@ -126,7 +126,7 @@
 //    }
 //    total = n;
 //    centroid = 0;
-//    maxp[centroid] = n;
+//    maxPart[centroid] = n;
 //    getCentroid(1, 0);
 //    compute(centroid);
 //    for (int i = 1; i <= m; i++) {

src/class183/Code02_Tree1.java

@@ -23,7 +23,7 @@ public class Code02_Tree1 {
 
 	public static boolean[] vis = new boolean[MAXN];
 	public static int[] siz = new int[MAXN];
-	public static int[] maxp = new int[MAXN];
+	public static int[] maxPart = new int[MAXN];
 	public static int centroid;
 
 	public static int[] dis = new int[MAXN];
@@ -39,17 +39,17 @@ public static void addEdge(int u, int v, int w) {
 
 	public static void getCentroid(int u, int fa) {
 		siz[u] = 1;
-		maxp[u] = 0;
+		maxPart[u] = 0;
 		for (int e = head[u]; e > 0; e = nxt[e]) {
 			int v = to[e];
 			if (v != fa && !vis[v]) {
 				getCentroid(v, u);
 				siz[u] += siz[v];
-				maxp[u] = Math.max(siz[v], maxp[u]);
+				maxPart[u] = Math.max(siz[v], maxPart[u]);
 			}
 		}
-		maxp[u] = Math.max(maxp[u], total - siz[u]);
-		if (maxp[u] < maxp[centroid]) {
+		maxPart[u] = Math.max(maxPart[u], total - siz[u]);
+		if (maxPart[u] < maxPart[centroid]) {
 			centroid = u;
 		}
 	}
@@ -92,7 +92,7 @@ public static long compute(int u) {
 				ans -= calc(v, u, weight[e]);
 				total = siz[v];
 				centroid = 0;
-				maxp[centroid] = n;
+				maxPart[centroid] = n;
 				getCentroid(v, 0);
 				ans += compute(centroid);
 			}
@@ -114,7 +114,7 @@ public static void main(String[] args) throws Exception {
 		k = in.nextInt();
 		total = n;
 		centroid = 0;
-		maxp[centroid] = n;
+		maxPart[centroid] = n;
 		getCentroid(1, 0);
 		out.println(compute(centroid));
 		out.flush();