解题报告:HDU 2196 Computer 简单树型DP
来源:互联网 发布:域名备案需要多少钱 编辑:程序博客网 时间:2024/06/02 12:20
Computer
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6360 Accepted Submission(s): 3202
Problem Description
A school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Managers of school are anxious about slow functioning of the net and want to know the maximum distance Si for which i-th computer needs to send signal (i.e. length of cable to the most distant computer). You need to provide this information.
Hint: the example input is corresponding to this graph. And from the graph, you can see that the computer 4 is farthest one from 1, so S1 = 3. Computer 4 and 5 are the farthest ones from 2, so S2 = 2. Computer 5 is the farthest one from 3, so S3 = 3. we also get S4 = 4, S5 = 4.
Hint: the example input is corresponding to this graph. And from the graph, you can see that the computer 4 is farthest one from 1, so S1 = 3. Computer 4 and 5 are the farthest ones from 2, so S2 = 2. Computer 5 is the farthest one from 3, so S3 = 3. we also get S4 = 4, S5 = 4.
Input
Input file contains multiple test cases.In each case there is natural number N (N<=10000) in the first line, followed by (N-1) lines with descriptions of computers. i-th line contains two natural numbers - number of computer, to which i-th computer is connected and length of cable used for connection. Total length of cable does not exceed 10^9. Numbers in lines of input are separated by a space.
Output
For each case output N lines. i-th line must contain number Si for i-th computer (1<=i<=N).
Sample Input
51 12 13 11 1
Sample Output
32344
Author
scnu
Recommend
lcy
#include<bits/stdc++.h>using namespace std;struct edge{ int t,w; edge(){}; edge(int _t,int _w){ t = _t ; w = _w; }};int n;int dp[10005][2];vector<edge>G[10005];void dfs1(int x){ dp[x][0]=0; for(int i=0;i<G[x].size();i++){ edge &j = G[x][i]; dfs1(j.t); dp[x][0] = max(dp[x][0],dp[j.t][0]+j.w); }return ;}void dfs2(int x,int fa=0){ dp[x][1]=dp[fa][1]; int w = 0; for(int i=0;i<G[fa].size();i++){ edge &j = G[fa][i]; if(j.t!=x){ dp[x][1] = max(dp[x][1],dp[j.t][0]+j.w); }else { w = j.w; } }dp[x][1] += w; for(int i=0;i<G[x].size();i++){ dfs2(G[x][i].t,x); }return ;}int main(){ while(scanf("%d",&n)==1){ for(int i=1;i<=n;i++){ G[i].clear(); } for(int i=2,f,w;i<=n;i++){ scanf("%d%d",&f,&w); G[f].push_back(edge(i,w)); }dfs1(1);dfs2(1); for(int i=1;i<=n;i++){ printf("%d\n",max(dp[i][0],dp[i][1])); } }return 0;}
0 0
- 解题报告:HDU 2196 Computer 简单树型DP
- hdu 1913 computer 部分贪心+一维dp 解题报告
- HDU - 2196 Computer 经典树型DP
- hdu 2196 Computer(树dp)
- hdu 2196 Computer DP
- hdu 1024 dp 解题报告
- hdu 2196 Computer(树dp)
- HDU-2196 Computer(树dp)
- HDU 2196 Computer (树型dp/树直径)
- Computer 解题报告
- HDU 4716 A Computer Graphics Problem 解题报告
- HDU 2196解题报告
- HDU 2196 Computer(树形dp)
- 【树形DP】 HDU 2196 Computer
- HDU 2196 Computer(树形DP)
- Hdu 2196 Computer(树形dp)
- Computer - HDU 2196 树形dp
- Hdu 2196 Computer (树形dp)
- STL实现简单的忽略大小写字 符串比较
- com.alibaba.druid.pool.vendor.MySqlValidConnectionChecker - Cannot resolve com.mysq.jdbc.Connection.
- 分布式服务框架 Zookeeper -- 管理分布式环境中的数据
- 2016 icpc china final
- LeetCode-Array-1. Two Sum
- 解题报告:HDU 2196 Computer 简单树型DP
- HTML的学习
- ORACLE SEQUENCE(队列)用法
- NULL UNIQUE唯一约束
- 关于java中的泛型的总结篇
- svn解决冲突办法
- Spark on Yarn集群搭建详细过程
- jquery的一些自己常用的方法技巧
- oracle中char与varchar2的区别