![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路
文章平均质量分 80
thunderMrbird
西北工业大学-李丰基
展开
-
UVA - 10537 The Toll! Revisited dijkstra反向
Sindbad the Sailor sold 66 silver spoons to the Sultan of Samarkand. The selling was quite easy; butdelivering was complicated. The items were transported over land, passing through several towns andv原创 2016-07-24 11:20:04 · 612 阅读 · 0 评论 -
UVA11374_Airport Express
In a small city called Iokh, a train service, Airport-Express,takes residents to the airport more quickly than other transports.There are two types of trains in Airport-Express,the Economy-Xpress and原创 2016-07-24 14:57:45 · 608 阅读 · 0 评论 -
hdu3592 差分约束问题
Description Nowadays, many people want to go to Shanghai to visit the World Exhibition. So there are always a lot of people who are standing along a straight line waiting for entering. Assume that原创 2016-07-29 14:35:48 · 386 阅读 · 0 评论 -
poj2594 经处理后的最小路径覆盖
题目描述: 给你一个有向无环图,有n个点,m条有向边。 一个机器人可以从任意点开始沿着边的方向走下去。对于每一个机器人:走过的点不能再走过。 问你最少用几个机器人可以走完所有的n个点,不同的机器人可以走相同的点。 可以看出这题类似于经典的最小路径覆盖。(注意最小路径覆盖和最小边覆盖的区别)只不过多了一个条件就是可以多个机器人访问同一个点。 思路也和之前一样,建图找最大匹配数,这时问题来了原创 2016-08-23 15:46:58 · 641 阅读 · 0 评论