树形DP
bootdubbo
这个作者很懒,什么都没留下…
展开
-
火山哥周游世界 (树形dp)
题意:一共有n个国家,标号1~n,每条边都有一定的时间花费,任意两个国家之间两两可达。火山哥一共决定去K个国家。现在他想要知道:如果他从第 i 个国家出发,经过这 K 个国家的最短时间是多少?输入:3 3 (n,k)1 2 12 3 4123输出:565输入:5 21 3 12 3 24 3 35 1 451输出:47584解题思路:出发点与...原创 2020-01-23 17:48:19 · 397 阅读 · 1 评论 -
牛客 2019
题意:给定一棵树,问树上有多少个点对之间的路径和为2019的倍数?思路:树形DPdp[u][j]dp[u][j]dp[u][j]:表示以u为根节点的树,距离节点uuu为jjj的路径有多少条#include<bits/stdc++.h>using namespace std;#define maxn 20010typedef long long ll;struct Edge...原创 2019-10-04 15:47:31 · 78 阅读 · 0 评论 -
有依赖的背包问题 【依赖背包】
有 N 个物品和一个容量是 V 的背包。物品之间具有依赖关系,且依赖关系组成一棵树的形状。如果选择一个物品,则必须选择它的父节点。如下图所示:如果选择物品5,则必须选择物品1和2。这是因为2是5的父节点,1是2的父节点。每件物品的编号是 i,体积是 vi,价值是 wi,依赖的父节点编号是 pi。物品的下标范围是 1…N。求解将哪些物品装入背包,可使物品总体积不超过背包容量,且总价值最大...原创 2019-09-20 11:58:29 · 2192 阅读 · 0 评论 -
POJ - 2486 Apple Tree【树形DP】
Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip at one node. S...原创 2019-09-29 14:38:24 · 138 阅读 · 0 评论 -
HDU-4003 Find Metal Mineral
Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each of them which formed a tree. Now Humans launches k robots ...原创 2019-09-29 11:43:58 · 89 阅读 · 0 评论 -
Roads in the North (树形DP)
Building and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is only one route from a village to a village that do...原创 2019-07-28 16:23:52 · 210 阅读 · 0 评论 -
Network (LCA+树形dp)
Yixght is a manager of the company called SzqNetwork(SN). Now she’s very worried because she has just received a bad news which denotes that DxtNetwork(DN), the SN’s business rival, intents to attack ...原创 2019-07-28 15:01:34 · 156 阅读 · 0 评论 -
Starship Troopers (树形DP)
You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each roo...原创 2019-07-27 23:46:51 · 159 阅读 · 0 评论 -
Rebuilding Roads(树形DP)
The cows have reconstructed Farmer John’s farm, with its N barns (1 <= N <= 150, number 1…N) after the terrible earthquake last May. The cows didn’t have time to rebuild any extra roads, so now ...原创 2019-07-27 22:38:20 · 634 阅读 · 0 评论 -
How far away ?
There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this “How far is it if I want to go from house A to house B”? Usually it hard to...原创 2019-08-01 10:40:14 · 90 阅读 · 0 评论 -
RXD and dividing (树形DP)
RXD has a tree T, with the size of n. Each edge has a cost.Define f(S) as the the cost of the minimal Steiner Tree of the set S on tree T.he wants to divide 2,3,4,5,6,…n into k parts S1,S2,S3,…Sk,w...原创 2019-08-01 10:14:43 · 151 阅读 · 0 评论 -
TELE (树形DP)
A TV-network plans to broadcast an important football match. Their network of transmitters and users can be represented as a tree. The root of the tree is a transmitter that emits the football match, ...原创 2019-07-27 13:53:28 · 223 阅读 · 0 评论 -
Strategic game(树形DP 最小点覆盖)
Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieva...原创 2019-07-27 11:55:36 · 142 阅读 · 0 评论 -
Godfather (树形DP,树的重心)
Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.Unfortunately, the structure ...原创 2019-07-27 11:48:38 · 262 阅读 · 0 评论 -
Abandoned country (最小生成树+树形DP)
An abandoned country has n(n≤100000) villages which are numbered from 1 to n. Since abandoned for a long time, the roads need to be re-built. There are m(m≤1000000) roads to be re-built, the length of...原创 2019-07-31 22:36:34 · 148 阅读 · 0 评论 -
Codeforces 239E World Eater Brothers【思维+树形DP】
You must have heard of the two brothers dreaming of ruling the world. With all their previous plans failed, this time they decided to cooperate with each other in order to rule the world.As you know ...原创 2019-07-27 00:16:14 · 215 阅读 · 1 评论 -
HYSBZ - 4033 树上染色
有一棵点数为N的树,树边有边权。给你一个在0~N之内的正整数K,你要在这棵树中选择K个点,将其染成黑色,并将其他的N-K个点染成白色。将所有点染色后,你会获得黑点两两之间的距离加上白点两两之间距离的和的收益。问收益最大值是多少。Input第一行两个整数N,K。接下来N-1行每行三个正整数fr,to,dis,表示该树中存在一条长度为dis的边(fr,to)。输入保证所有点之间是联通的。N&...原创 2019-07-25 23:56:31 · 153 阅读 · 0 评论 -
Cell Phone Network【最小支配集】
Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell phone towers on his N (1 ≤ N ≤ 10,000) pastures...原创 2019-07-28 23:32:43 · 199 阅读 · 0 评论