import java.util.*;
import java.io.*;
public class Main{
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
static int[][] edge;
static boolean[] judge;
static int n,m,max,distance;
public static void main(String[] args) throws IOException {
String[] S = br.readLine().split(" ");
n = Integer.parseInt(S[0]);
m = Integer.parseInt(S[1]);
edge = new int[n+1][n+1];
max = 0;
distance = 0;
for(int i = 0 ; i < m ; i++) {
S = br.readLine().split(" ");
int x = Integer.parseInt(S[0]);
int y = Integer.parseInt(S[1]);
int z = Integer.parseInt(S[2]);
edge[x][y] = Math.max(edge[x][y], z);
edge[y][x] = Math.max(edge[y][x], z);
}
for(int i = 1 ; i <= n ;i++) {
judge = new boolean[n+1];
judge[i] = true;
DFS(i);
}
out.write(max + "");
out.flush();
out.close();
br.close();
}
private static void DFS(int layer) {
for(int i = 1 ; i <= n ; i++) {
if(edge[layer][i] != 0 && !judge[i]) {
judge[i] = true;
distance += edge[layer][i];
DFS(i);
distance -= edge[layer][i];
judge[i] = false;
}
}
max = Math.max(max,distance);
}
}
洛谷 P1294 高手去散步 Java
最新推荐文章于 2024-05-31 10:46:10 发布