<?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/%E9%93%BE%E5%BC%8F%E5%89%8D%E5%90%91%E6%98%9F/</link><description>Recent content in 链式前向星 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Tue, 24 May 2016 11:36:07 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E9%93%BE%E5%BC%8F%E5%89%8D%E5%90%91%E6%98%9F/index.xml" rel="self" type="application/rss+xml"/><item><title>poj 1511 Invitation Cards (链式前向星存图+spfa)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-05-24-poj-1511/</link><pubDate>Tue, 24 May 2016 11:36:07 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-05-24-poj-1511/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=1511" target="_blank" rel="noreferrer"&gt;poj 1511 题目链接&lt;/a&gt;
题意：和那道奶牛的舞会类似，要求所有点到点1的距离和加上1点到所有点的距离和。
思路：正反存边建两次图，跑两次spfa. 然而用vector会TLE&amp;hellip;.所以去学习了新的建图方式。。。也就是链式前向星：&lt;a href="http://blog.csdn.net/acdreamers/article/details/16902023" target="_blank" rel="noreferrer"&gt;链式前向星（边表）学习链接&lt;/a&gt; 也叫边表。&lt;/p&gt;</description></item></channel></rss>