本文讨论了Alice和Bob通过互联网进行数据通信的问题，其中数据包在路由器之间传输的成功率由特定的概率pi给出。目标是找到一条路径，使得所有数据能够以最小的预期时间到达目的地。给出了输入输出格式以及样例输入输出，并提供了问题的解析和解决方案，即求解最大一次性传输成功率对应的最小时间期望。
参看资料：
https://blog.csdn.net/qq_31759205/article/details/54716066
题目：
Alice and Bob are trying to communicate through the internet. Just assume that there are N routers in the internet and they are numbered from 0 to N-1. Alice is directly connected to router 0 and Bob is directly connected to router N-1. Alice initiates the connection and she wants to send S KB of data to Bob. Data can go to the (N-1)th router from the 0throuter either directly or via some intermediate routers. There are some bidirectional links between some routers.
The links between the routers are not necessarily 100% perfect. So, for each link, a probability pi is given. That means if uand v are two routers and if their underlying link has probability pi, it means that if data is sent from u to v, the probability of successfully getting the data in v is pi and vice versa. If multiple links are used the probability of getting the data in destination is the multiplication of the probabilities of the link
最低0.47元/天 解锁文章
426
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
