![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路
Joel__Li
星空和代码都有浪漫
展开
-
lightOJ1074 spfa
题目地址在这里题目描述Dhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoid shortest routes, and hence the crowded roads, to r...原创 2018-11-22 11:48:10 · 173 阅读 · 0 评论 -
hdu3416 最短路+最大流
题目链接在这里题目描述Do not sincere non-interference。Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae is in city A and girls are in city B. Every time s...原创 2018-11-22 22:12:00 · 285 阅读 · 0 评论 -
hdu4370 最短路
题目链接在这里问题描述Given a n*n matrix Cij (1<=i,j<=n),We want to find a n*n matrix Xij (1<=i,j<=n),which is 0 or 1.Besides,Xij meets the following conditions:1.X12+X13+...X1n=12.X1n+X2n+......原创 2018-11-24 13:49:58 · 189 阅读 · 0 评论 -
poj3169 差分约束+spfa
题目链接在这里题目大意是有N头牛,有的牛喜欢相互挨得近一点,有的想相互离得远一点。输入的第一行给出三个数N, ML, MD,分别代表N头牛,有ML条数据是离得近一点,MD条数据是离得远一点。接下来有ML + MD条数据,每条数据有a b c三个数,代表牛a和牛b离得不超过(或者最少是)c。问第一头牛和第二头牛最远能隔多少。这是一个差分约束题目,我们分析一下。假设a是编号比较小的牛,即a...原创 2018-11-25 23:05:15 · 166 阅读 · 0 评论