URAL 1018 Binary Apple Tree (树形DP)

最新推荐文章于 2020-10-04 15:27:00 发布

tiutiu2011

最新推荐文章于 2020-10-04 15:27:00 发布

阅读量432

点赞数

分类专栏： ACM-ICPC Talk is cheap Show me the code 文章标签： URAL 1018 Binary Apple Tree 树形 DP

本文链接：https://blog.youkuaiyun.com/tiutiu2011/article/details/49357305

版权

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章

订阅专栏

ACM-ICPC

154 篇文章

订阅专栏

本文详细介绍了使用C语言实现深度优先搜索（DFS）算法，解决了一个涉及苹果树枝干最大苹果数量的问题。通过定义结构体、数组和函数，作者展示了如何在有限的枝干和点之间计算每个点的最大苹果数量。此过程涉及到递归调用和数组的高效使用，最终输出所有枝干中最大的苹果数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#define MAX_POINTS 100
#define MAX(x, y) ( (x) > (y) ? (x) : (y) )

typedef struct Branch{
int to;
int apples;
int next;
}Branch;
Branch BranchArray[MAX_POINTS * 2];
int BranchNum;
int head[MAX_POINTS + 1];
int branches[MAX_POINTS + 1];
//maxApple[point][preBranches]表示点point的前preBreanches个枝干branch的最大苹果数
int maxApples[MAX_POINTS + 1][MAX_POINTS + 1];
int visited[MAX_POINTS + 1];
int numOfPoints, numOfBranchesPreserved;

void addBranch(int from, int to, int apples){
BranchNum++;
BranchArray[BranchNum].to = to;
BranchArray[BranchNum].apples = apples;
BranchArray[BranchNum].next = head[from];
head[from] = BranchNum;
}

void dfs(int fromParent, int from){
int leftChild = 0;
int rightChild = 0;
int leftApples = 0;
int rightApples = 0;
int i;
for (i = head[from]; i != 0; i = BranchArray[i].next){
if (BranchArray[i].to == fromParent)
continue;
if (leftChild == 0){
leftChild = BranchArray[i].to;
leftApples = BranchArray[i].apples;
if (visited[leftChild] == 0){
visited[leftChild] = 1;
dfs(from, leftChild);
}
} else {
rightChild = BranchArray[i].to;
rightApples = BranchArray[i].apples;
if (visited[rightChild] == 0){
visited[rightChild] = 1;
dfs(from, rightChild);
}
}
}

//只有一个枝干的情况，左枝干或者右枝干
maxApples[from][1] = MAX(leftApples, rightApples);

int temp = leftApples + rightApples;

int j;
for (i = 2; i <= numOfBranchesPreserved; i++){
//枝干全在左边，或者全在右边
maxApples[from][i] = MAX(maxApples[leftChild][i - 1] + leftApples, maxApples[rightChild][i - 1] + rightApples);
for (j = 0; j <= i - 2; j++)
//一边至少有一个枝干
maxApples[from][i] = MAX(maxApples[from][i], maxApples[leftChild][j] + maxApples[rightChild][i - 2 - j] + temp);
}

}

int main(){

scanf("%d%d", &numOfPoints, &numOfBranchesPreserved);

int from, to, apples;
numOfPoints--;
while (numOfPoints--){
scanf("%d%d%d", &from, &to, &apples);
addBranch(from, to, apples);
addBranch(to, from, apples);
}

visited[1] = 1;
dfs(-1, 1);

printf("%d\n", maxApples[1][numOfBranchesPreserved]);

return 0;
}