<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>虚点 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E8%99%9A%E7%82%B9/</link><description>Recent content in 虚点 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sat, 21 May 2016 04:58:22 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E8%99%9A%E7%82%B9/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 2874 Connections between cities (添加虚点，并查集+LCA(rmq+dfs))</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-05-21-hdu-2874/</link><pubDate>Sat, 21 May 2016 04:58:22 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-05-21-hdu-2874/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=2874" target="_blank" rel="noreferrer"&gt;hdu2874题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给一个森林，问两点的最短距离，或者输出两点不联通。&lt;/p&gt;
&lt;p&gt;思路：&lt;strong&gt;最最重要的一点是:添加虚点！&lt;/strong&gt;&lt;/p&gt;</description></item></channel></rss>