本文共 851 字，大约阅读时间需要 2 分钟。
package YuanFuDao;
import java.util.*;
public class Main {
public static int dfs(int rt, int ans,int[] val, HashMap> map){
int ret = val[rt];
if (map.containsKey(rt)){
LinkedList list = map.get(rt);
for (int v :
list) {
ret = Math.max(ret, ret + dfs(v,ans,val,map));
}
}
ans = Math.max(ans, ret);
return ans;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] val = new int[N];
int rt = -1;
HashMap> map = new HashMap<>();
for (int i = 0; i
int fa;
val[i] = sc.nextInt();
fa = sc.nextInt();
if (fa == 0){
rt = i;
}else {
int res = fa - 2;
if (map.containsKey(res)){
LinkedList list = map.get(res);
list.add(i);
}else {
LinkedList list = new LinkedList<>();
list.add(i);
map.put(res,list);
}
}
}
int ans = Integer.MIN_VALUE;
int dfs = dfs(rt, ans, val, map);
System.out.println("Max: "+dfs);
}
}
转载地址：https://blog.csdn.net/weixin_32541663/article/details/114938745 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！
发表评论
最新留言
关于作者
