uva 1267 Network（DFS）

最新推荐文章于 2022-03-31 11:15:16 发布

SPZn_up

最新推荐文章于 2022-03-31 11:15:16 发布

阅读量663

点赞数

分类专栏： ====ACM===== 大白文章标签： uva C语言

本文链接：https://blog.csdn.net/llx523113241/article/details/43338831

版权

这是一个关于树形网络的问题，其中内部节点是服务器，终端节点是客户。给定一个VOD服务器，需要确保所有客户到服务器的距离不超过k。如果存在一组客户超过这个距离，则需要在其他服务器上复制VOD系统以满足服务质量。问题要求找到最小的复制数量以确保每个客户都在k距离内。例子中解释了如何计算所需的最小复制数量。

摘要由CSDN通过智能技术生成

uva 1267 Network

Consider a tree network with n nodes where the internal nodes correspond to servers and the terminal nodes correspond to clients. The nodes are numbered from 1 to n . Among the servers, there is an original server S which provides VOD (Video On Demand) service. To ensure the quality of service for the clients, the distance from each client to the VOD server S should not exceed a certain value k . The distance from a node u to a node v in the tree is defined to be the number of edges on the path from u to v . If there is a nonempty subset C of clients such that the distance from each u in C to S is greater than k , then replicas of the VOD system have to be placed in some servers so that the distance from each client to the nearest VOD server (the original VOD system or its replica) is k or less.