﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-&lt;FONT face="Arial Black" size=12&gt;&lt;FONT color=#663399 qq&gt;F&lt;/FONT&gt;&lt;FONT color=#00ade5 qq&gt;e&lt;/FONT&gt;&lt;FONT color=#663399 qq&gt;l&lt;/FONT&gt;&lt;FONT color=#00b085 qq&gt;i&lt;/FONT&gt;&lt;FONT color=#cc6633 qq&gt;c&lt;/FONT&gt;&lt;FONT color=#00b085 qq&gt;i&lt;/FONT&gt;&lt;FONT color=#00ade5 qq&gt;a&lt;/FONT&gt;&lt;/FONT&gt;-随笔分类-图论</title><link>http://www.cppblog.com/Felicia/category/4907.html</link><description /><language>zh-cn</language><lastBuildDate>Tue, 20 May 2008 02:12:08 GMT</lastBuildDate><pubDate>Tue, 20 May 2008 02:12:08 GMT</pubDate><ttl>60</ttl><item><title>[图论]pku3417</title><link>http://www.cppblog.com/Felicia/archive/2007/10/06/33653.html</link><dc:creator>Felicia</dc:creator><author>Felicia</author><pubDate>Sat, 06 Oct 2007 12:53:00 GMT</pubDate><guid>http://www.cppblog.com/Felicia/archive/2007/10/06/33653.html</guid><wfw:comment>http://www.cppblog.com/Felicia/comments/33653.html</wfw:comment><comments>http://www.cppblog.com/Felicia/archive/2007/10/06/33653.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Felicia/comments/commentRss/33653.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Felicia/services/trackbacks/33653.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 我的做法是，对于每条新边，记录树中与之对应的路径。然后对于每条树边，统计被对应的次数。最后记录每个点到树根的路径上，有多少个1（设为q[i]）。对于新边(x,y)，它对答案的贡献就是q[x] + q[y] - 2q[lca(x,y)]。除了这些，答案还应加上树中0边的数量 * m。<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/Felicia/archive/2007/10/06/33653.html'>阅读全文</a><img src ="http://www.cppblog.com/Felicia/aggbug/33653.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Felicia/" target="_blank">Felicia</a> 2007-10-06 20:53 <a href="http://www.cppblog.com/Felicia/archive/2007/10/06/33653.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[图论][zz]给出一个没有偶圈的简单无向图，求两个顶点间路径的数目</title><link>http://www.cppblog.com/Felicia/archive/2007/09/19/32456.html</link><dc:creator>Felicia</dc:creator><author>Felicia</author><pubDate>Wed, 19 Sep 2007 02:08:00 GMT</pubDate><guid>http://www.cppblog.com/Felicia/archive/2007/09/19/32456.html</guid><wfw:comment>http://www.cppblog.com/Felicia/comments/32456.html</wfw:comment><comments>http://www.cppblog.com/Felicia/archive/2007/09/19/32456.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/Felicia/comments/commentRss/32456.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Felicia/services/trackbacks/32456.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 给出一个没有偶圈的简单无向图，求两个顶点间路径的数目<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/Felicia/archive/2007/09/19/32456.html'>阅读全文</a><img src ="http://www.cppblog.com/Felicia/aggbug/32456.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Felicia/" target="_blank">Felicia</a> 2007-09-19 10:08 <a href="http://www.cppblog.com/Felicia/archive/2007/09/19/32456.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[图论]pku1125</title><link>http://www.cppblog.com/Felicia/archive/2007/09/02/31413.html</link><dc:creator>Felicia</dc:creator><author>Felicia</author><pubDate>Sun, 02 Sep 2007 12:09:00 GMT</pubDate><guid>http://www.cppblog.com/Felicia/archive/2007/09/02/31413.html</guid><wfw:comment>http://www.cppblog.com/Felicia/comments/31413.html</wfw:comment><comments>http://www.cppblog.com/Felicia/archive/2007/09/02/31413.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/Felicia/comments/commentRss/31413.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Felicia/services/trackbacks/31413.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 简单题。很早以前做的。贴一下凌乱的代码。<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/Felicia/archive/2007/09/02/31413.html'>阅读全文</a><img src ="http://www.cppblog.com/Felicia/aggbug/31413.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Felicia/" target="_blank">Felicia</a> 2007-09-02 20:09 <a href="http://www.cppblog.com/Felicia/archive/2007/09/02/31413.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[图论]最大流(类实现)</title><link>http://www.cppblog.com/Felicia/archive/2007/08/13/29931.html</link><dc:creator>Felicia</dc:creator><author>Felicia</author><pubDate>Mon, 13 Aug 2007 13:12:00 GMT</pubDate><guid>http://www.cppblog.com/Felicia/archive/2007/08/13/29931.html</guid><wfw:comment>http://www.cppblog.com/Felicia/comments/29931.html</wfw:comment><comments>http://www.cppblog.com/Felicia/archive/2007/08/13/29931.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/Felicia/comments/commentRss/29931.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Felicia/services/trackbacks/29931.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 复杂度 O(n^2m)。支持一边构建网络，一边求最大流。每次调用 flow()，得到当前新增的流量。<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/Felicia/archive/2007/08/13/29931.html'>阅读全文</a><img src ="http://www.cppblog.com/Felicia/aggbug/29931.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Felicia/" target="_blank">Felicia</a> 2007-08-13 21:12 <a href="http://www.cppblog.com/Felicia/archive/2007/08/13/29931.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>单源最短路 Dijkstra O(mlogn) (类实现)</title><link>http://www.cppblog.com/Felicia/archive/2007/08/13/29874.html</link><dc:creator>Felicia</dc:creator><author>Felicia</author><pubDate>Mon, 13 Aug 2007 02:01:00 GMT</pubDate><guid>http://www.cppblog.com/Felicia/archive/2007/08/13/29874.html</guid><wfw:comment>http://www.cppblog.com/Felicia/comments/29874.html</wfw:comment><comments>http://www.cppblog.com/Felicia/archive/2007/08/13/29874.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Felicia/comments/commentRss/29874.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Felicia/services/trackbacks/29874.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 单源最短路 Dijkstra O(mlogn) (类实现)<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/Felicia/archive/2007/08/13/29874.html'>阅读全文</a><img src ="http://www.cppblog.com/Felicia/aggbug/29874.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Felicia/" target="_blank">Felicia</a> 2007-08-13 10:01 <a href="http://www.cppblog.com/Felicia/archive/2007/08/13/29874.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>二分图最大匹配(类实现)</title><link>http://www.cppblog.com/Felicia/archive/2007/08/11/29803.html</link><dc:creator>Felicia</dc:creator><author>Felicia</author><pubDate>Sat, 11 Aug 2007 13:30:00 GMT</pubDate><guid>http://www.cppblog.com/Felicia/archive/2007/08/11/29803.html</guid><wfw:comment>http://www.cppblog.com/Felicia/comments/29803.html</wfw:comment><comments>http://www.cppblog.com/Felicia/archive/2007/08/11/29803.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Felicia/comments/commentRss/29803.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Felicia/services/trackbacks/29803.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二分图最大匹配(类实现)<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/Felicia/archive/2007/08/11/29803.html'>阅读全文</a><img src ="http://www.cppblog.com/Felicia/aggbug/29803.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Felicia/" target="_blank">Felicia</a> 2007-08-11 21:30 <a href="http://www.cppblog.com/Felicia/archive/2007/08/11/29803.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>