modify code

Author: algorithmzuo

src/class183/Code04_CloseVertices1.java

@@ -32,6 +32,22 @@ public class Code04_CloseVertices1 {
 
 	public static int[] tree = new int[MAXN];
 
+	public static void sort(int l, int r) {
+		if (l >= r) return;
+		int i = l, j = r, pivot = disArr[(l + r) >> 1], tmp;
+		while (i <= j) {
+			while (disArr[i] < pivot) i++;
+			while (disArr[j] > pivot) j--;
+			if (i <= j) {
+				tmp = disArr[i]; disArr[i] = disArr[j]; disArr[j] = tmp;
+				tmp = depArr[i]; depArr[i] = depArr[j]; depArr[j] = tmp;
+				i++; j--;
+			}
+		}
+		sort(l, j);
+		sort(i, r);
+	}
+
 	public static void addEdge(int u, int v, int w) {
 		nxt[++cntg] = head[u];
 		to[cntg] = v;
@@ -90,22 +106,6 @@ public static void dfs(int u, int fa, int dis, int dep) {
 		}
 	}
 
-	public static void sort(int l, int r) {
-		if (l >= r) return;
-		int i = l, j = r, pivot = disArr[(l + r) >> 1], tmp;
-		while (i <= j) {
-			while (disArr[i] < pivot) i++;
-			while (disArr[j] > pivot) j--;
-			if (i <= j) {
-				tmp = disArr[i]; disArr[i] = disArr[j]; disArr[j] = tmp;
-				tmp = depArr[i]; depArr[i] = depArr[j]; depArr[j] = tmp;
-				i++; j--;
-			}
-		}
-		sort(l, j);
-		sort(i, r);
-	}
-
 	public static long calc(int u, int dis, int dep) {
 		cnta = 0;
 		dfs(u, 0, dis, dep);

src/class183/Code05_Message1.java

@@ -31,7 +31,7 @@ public class Code05_Message1 {
 	public static int centroid;
 
 	public static int[] depCnt = new int[MAXN];
-	public static int maxDeep;
+	public static int maxDep;
 
 	public static int[] timArr = new int[MAXN];
 	public static int[] qidArr = new int[MAXN];
@@ -126,19 +126,19 @@ public static void getCentroid2(int cur, int fa) {
 	}
 
 	// 收集信息递归版，java会爆栈，C++可以通过
-	public static void dfs1(int u, int fa, int deep) {
-		depCnt[deep]++;
-		maxDeep = Math.max(maxDeep, deep);
+	public static void dfs1(int u, int fa, int dep) {
+		depCnt[dep]++;
+		maxDep = Math.max(maxDep, dep);
 		for (int e = headq[u]; e > 0; e = nextq[e]) {
-			if (tim[e] + 1 >= deep) {
-				timArr[++cnta] = tim[e] - deep + 2;
+			if (tim[e] + 1 >= dep) {
+				timArr[++cnta] = tim[e] - dep + 2;
 				qidArr[cnta] = qid[e];
 			}
 		}
 		for (int e = headg[u]; e > 0; e = nextg[e]) {
 			int v = tog[e];
 			if (v != fa && !vis[v]) {
-				dfs1(v, u, deep + 1);
+				dfs1(v, u, dep + 1);
 			}
 		}
 	}
@@ -151,7 +151,7 @@ public static void dfs2(int cur, int fa, int deep) {
 			pop();
 			if (e == -1) {
 				depCnt[dep]++;
-				maxDeep = Math.max(maxDeep, dep);
+				maxDep = Math.max(maxDep, dep);
 				for (int e = headq[u]; e > 0; e = nextq[e]) {
 					if (tim[e] + 1 >= dep) {
 						timArr[++cnta] = tim[e] - dep + 2;
@@ -174,26 +174,26 @@ public static void dfs2(int cur, int fa, int deep) {
 
 	public static void calc(int u) {
 		cnta = 0;
-		maxDeep = 0;
+		maxDep = 0;
 		// dfs1(u, 0, 1);
 		dfs2(u, 0, 1);
 		for (int i = 1; i <= cnta; i++) {
 			ans[qidArr[i]] += depCnt[timArr[i]];
 		}
-		for (int d = 1; d <= maxDeep; d++) {
+		for (int d = 1; d <= maxDep; d++) {
 			depCnt[d] = 0;
 		}
 		for (int e = headg[u]; e > 0; e = nextg[e]) {
 			int v = tog[e];
 			if (!vis[v]) {
 				cnta = 0;
-				maxDeep = 0;
+				maxDep = 0;
 				// dfs1(v, u, 2);
 				dfs2(v, u, 2);
 				for (int i = 1; i <= cnta; i++) {
 					ans[qidArr[i]] -= depCnt[timArr[i]];
 				}
-				for (int d = 1; d <= maxDeep; d++) {
+				for (int d = 1; d <= maxDep; d++) {
 					depCnt[d] = 0;
 				}
 			}

src/class183/Code07_Maschera1.java

@@ -59,6 +59,22 @@ public static void pop() {
 		e = stack[stacksize][4];
 	}
 
+	public static void sort(int[] maxv, int[] edge, int l, int r) {
+		if (l >= r) return;
+		int i = l, j = r, pivot = maxv[(l + r) >> 1], tmp;
+		while (i <= j) {
+			while (maxv[i] < pivot) i++;
+			while (maxv[j] > pivot) j--;
+			if (i <= j) {
+				tmp = maxv[i]; maxv[i] = maxv[j]; maxv[j] = tmp;
+				tmp = edge[i]; edge[i] = edge[j]; edge[j] = tmp;
+				i++; j--;
+			}
+		}
+		sort(maxv, edge, l, j);
+		sort(maxv, edge, i, r);
+	}
+
 	public static void addEdge(int u, int v, int w) {
 		nxt[++cntg] = head[u];
 		to[cntg] = v;
@@ -180,22 +196,6 @@ public static void dfs2(int cur, int fa, int pmaxv, int pedge) {
 		}
 	}
 
-	public static void sort(int[] maxv, int[] edge, int l, int r) {
-		if (l >= r) return;
-		int i = l, j = r, pivot = maxv[(l + r) >> 1], tmp;
-		while (i <= j) {
-			while (maxv[i] < pivot) i++;
-			while (maxv[j] > pivot) j--;
-			if (i <= j) {
-				tmp = maxv[i]; maxv[i] = maxv[j]; maxv[j] = tmp;
-				tmp = edge[i]; edge[i] = edge[j]; edge[j] = tmp;
-				i++; j--;
-			}
-		}
-		sort(maxv, edge, l, j);
-		sort(maxv, edge, i, r);
-	}
-
 	public static void calc(int u) {
 		cnta = 0;
 		for (int e = head[u]; e > 0; e = nxt[e]) {