Codeforces Round #506 (Div. 3) E. Tree with Small Distances(树形DP)补题
题目:E. Tree with Small Distances题意给出一颗具有n个顶点的无向树,增加最小的边数量,使从根结点1到任意顶点的最短路径长度不超过2.题解先用树形dp求出每个结点到根结点1的路径长度,最后按路径长度从大到小排序,将路径长度大于2的结点的父节点与根结点相连,修改次数则加一,最后求出修改总次数。ac代码:#include<iostream>#include<iomanip>#include<cstring>#include<c
原创
2021-01-22 20:07:56 ·
120 阅读 ·
0 评论