hdu5534 Partial Tree
来源:互联网 发布:桌面中考倒计时软件 编辑:程序博客网 时间:2024/05/15 09:57
Partial Tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 599 Accepted Submission(s): 294
Problem Description
In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two nodes are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.
You find a partial tree on the way home. This tree hasn nodes but lacks of n−1 edges. You want to complete this tree by adding n−1 edges. There must be exactly one path between any two nodes after adding. As you know, there arenn−2 ways to complete this tree, and you want to make the completed tree as cool as possible. The coolness of a tree is the sum of coolness of its nodes. The coolness of a node isf(d) , where f is a predefined function and d is the degree of this node. What's the maximum coolness of the completed tree?
You find a partial tree on the way home. This tree has
Input
The first line contains an integer T indicating the total number of test cases.
Each test case starts with an integern in one line,
then one line withn−1 integers f(1),f(2),…,f(n−1) .
1≤T≤2015
2≤n≤2015
0≤f(i)≤10000
There are at most10 test cases with n>100 .
Each test case starts with an integer
then one line with
There are at most
Output
For each test case, please output the maximum coolness of the completed tree in one line.
Sample Input
232 145 1 4
Sample Output
519
Source
2015ACM/ICPC亚洲区长春站-重现赛(感谢东北师大)
题意:构建一个n个点的树,每个点的度i的价值为f(i),求能获得的最大价值。
思路:树的度总和是2*(n-1),把题目看作是将2*(n-1)个物品放进n个背包,看作背包问题,但是这样还有个条件限制就是每个背包至少要有1个物品(1个度),这样做要用O(n^3),但如果事先每个点分配一个度,那么其他的度就可以任意分配了,现在题目可以看作,把n-2个物品放进1个背包里,并且f(i)都要减去f(1)。
#include <stdio.h>#include <string.h>#define maxn 2050#define ll long long intconst int inf = 0x3f3f3f3f;ll w[maxn], dp[maxn];ll max(ll a, ll b){ return a>b?a:b;}int main(){ ll T, n, i, j, v; scanf("%I64d", &T); while(T--){ scanf("%I64d", &n); for(i = 1;i < n;i++) scanf("%I64d", &w[i]); memset(dp, 0, sizeof dp); dp[0] = n*w[1];//先每个点分配一个度 v = 2*(n - 1) - n;//现在的每个点最多分配n - 2个度 for(i = 2;i < n;i++) for(j = i - 1;j <= v;j++)//原先已经分配了一个度,要减去1 dp[j] = max(dp[j], dp[j - i + 1] + w[i] - w[1]);//贡献值都要减去w[1] printf("%I64d\n", dp[v]); }}
0 0
- hdu5534 Partial Tree
- hdu5534 Partial Tree
- hdu5534 Partial Tree
- hdu5534 Partial Tree
- hdu5534 Partial Tree(dp)
- HDU5534 Partial Tree 【DP】
- HDU5534 Partial Tree
- hdu5534 Partial Tree 完全背包
- HDU5534--Partial Tree (完全背包)
- hdu5534 Partial Tree (巧妙转为完全背包)
- HDU5534 Partial Tree(15年亚洲区长春站) DP
- 【hdu5534】【2015ACM/ICPC亚洲区长春站】Partial Tree 题意&题解&代码
- 【HDU5534 2015长春赛区H】【树上DP转完全背包】Partial Tree 不同度不同权对应最大树权
- hdu5534
- hdu 5534 Partial Tree
- HDU 5534 Partial Tree
- hdu 5534 Partial Tree
- HDU-5534-Partial Tree
- zigbee flash 操作
- 【Java学习笔记】I/O
- 运用URLClassLoader加载外部jar包的java类,生成Class文件
- 【NOIP2015】day2_ 跳石头
- 13.UILabel 中的一些属性
- hdu5534 Partial Tree
- POJ3261 Milk Patterns 题解&代码
- Python 多线程抓取图片效率实验
- Ajax基础
- 三层总结
- 学习SpringMVC 笔记
- ubuntu下配置java环境
- Libimseti上的匿名用户推荐系统
- React Native-11.React Native TabBarIOS TabBarIOS.Item组件详解