hdu1520——Anniversary party(树形dp)
来源:互联网 发布:java管理系统界面 编辑:程序博客网 时间:2024/05/23 19:46
Problem Description
There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation forms a tree rooted at the rector V. E. Tretyakov. In order to make the party funny for every one, the rector does not want both an employee and his or her immediate supervisor to be present. The personnel office has evaluated conviviality of each employee, so everyone has some number (rating) attached to him or her. Your task is to make a list of guests with the maximal possible sum of guests’ conviviality ratings.
Input
Employees are numbered from 1 to N. A first line of input contains a number N. 1 <= N <= 6 000. Each of the subsequent N lines contains the conviviality rating of the corresponding employee. Conviviality rating is an integer number in a range from -128 to 127. After that go T lines that describe a supervisor relation tree. Each line of the tree specification has the form:
L K
It means that the K-th employee is an immediate supervisor of the L-th employee. Input is ended with the line
0 0
Output
Output should contain the maximal sum of guests’ ratings.
Sample Input
7
1
1
1
1
1
1
1
1 3
2 3
6 4
7 4
4 5
3 5
0 0
Sample Output
5
看起来好像和poj2342一样,但拿那个代码交会超时,看来这道题的数据更强。
所以要换一种方式,用结构体内函数
#include <iostream>#include <cstring>#include <string>#include <vector>#include <queue>#include <cstdio>#include <set>#include <math.h>#include <algorithm>#include <queue>#include <iomanip>#define INF 0x3f3f3f3f#define MAXN 6005#define Mod 99999999using namespace std;struct Node{ int father,child,brother,in,notin; int max() { return in>notin?in:notin; } void Init() { father=child=brother=notin=0; }};Node tree[MAXN];void dfs(int root){ int son=tree[root].child; while(son) { dfs(son); tree[root].in+=tree[son].notin; tree[root].notin+=tree[son].max(); son=tree[son].brother; }}int main(){ int n; while(scanf("%d",&n)!=EOF) { for(int i=1; i<=n; ++i) { tree[i].Init(); scanf("%d",&tree[i].in); } int l,k; while(scanf("%d%d",&l,&k)) { if(l==0&&k==0) break; tree[l].father=k; tree[l].brother=tree[k].child; tree[k].child=l; } for(int i=1; i<=n; ++i) if(!tree[i].father) { dfs(i); printf("%d\n",tree[i].max()); break; } } return 0;}
- HDU1520 Anniversary party —— 树形DP
- hdu1520——Anniversary party(树形dp)
- 树形dp Anniversary party(HDU1520)
- hdu1520 Anniversary party(poj2342,树形dp)
- HDU1520 Anniversary party(树形DP)
- HDU1520 Anniversary party(树形dp)
- hdu1520 Anniversary party 树形dp
- HDU1520:Anniversary party(树形DP)
- hdu1520 Anniversary party(树形DP)
- hdu1520 Anniversary party (树形dp)
- hdu1520 Anniversary party 【树形dp】
- HDU1520 Anniversary party(树形DP)
- 【树形DP】HDU1520-Anniversary party
- HDU1520 Anniversary party 树形DP
- HDU1520 Anniversary party[树形DP]
- HDU1520 Anniversary party 树形DP
- hdu1520-树形dp-Anniversary party
- hdu1520 Anniversary party 树形dp
- 蓝桥 画表格
- Xcode磁盘空间大清理
- SQL 分割字符串和通用分页查询存储过程
- Perfect Squares
- 计算一个整数的阶乘
- hdu1520——Anniversary party(树形dp)
- 1023. Have Fun with Numbers (20)
- PAT 1068. 万绿丛中一点红(20)
- 商品属性表设计
- 短信验证
- python
- ajax-get方式提交到后台
- 2-hadoop 存储与架构
- 2017蓝桥杯模拟赛 Problem A: 算年龄(5分)