<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hahaAll的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hahaAll</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hahaAll]]></copyright><item><title><![CDATA[hdu4417Super Mario]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/53402028</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/53402028</guid><author>hahaAll</author><pubDate>Tue, 29 Nov 2016 23:34:36 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=4417


Super Mario
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5531    Accepted Submission(s]]></description><category></category></item><item><title><![CDATA[矩阵快速幂lightoj1132 - Summing up Powers]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52934967</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52934967</guid><author>hahaAll</author><pubDate>Wed, 26 Oct 2016 15:45:16 +0800</pubDate><description><![CDATA[1132 - Summing up Powers





   
PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 32 MB





Given N and K, you have to find
(1K + 2K + 3K + ...]]></description><category></category></item><item><title><![CDATA[矩阵快速幂hdu3306Another kind of Fibonacci]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52933096</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52933096</guid><author>hahaAll</author><pubDate>Wed, 26 Oct 2016 12:34:35 +0800</pubDate><description><![CDATA[Another kind of Fibonacci
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2370    Accepted Submission(s): 945


Problem Description
As we]]></description><category></category></item><item><title><![CDATA[判定二分图——染色法VjP1462小胖的难题]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52800993</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52800993</guid><author>hahaAll</author><pubDate>Wed, 12 Oct 2016 21:42:29 +0800</pubDate><description><![CDATA[P1462小胖的难题：https://vijos.org/p/1462

描述

王小胖最近对图论产生了很浓的兴趣，尤其是关于回路的问题。
回路是图论中经典的内容。回路相关知识定义如下：
通路的长度：通路中边的条数。 
回路：如果通路中始点与终点相同。 
简单通路：如果通路中各边都不相同。
基本通路：如果通路中各顶点都不相同。显然（基本通路一定是简单通路，但简单通路不一定是基本通]]></description><category></category></item><item><title><![CDATA[线段树扫描线hdu1828Picture]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52723839</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52723839</guid><author>hahaAll</author><pubDate>Sun, 02 Oct 2016 15:37:39 +0800</pubDate><description><![CDATA[线段树扫描线hdu1828Picture ：http://acm.hdu.edu.cn/showproblem.php?pid=1828
思路：求矩形周长并……可以把矩形分成横线和竖线两部分，并将两条横线和两条竖线都分别标记为-1、1。然后建两遍数，将结果相加就可以了（也有其他建一遍树的做法）……但这个题值得说的就是用这种做法有一个坑……将矩形的横线和竖线的坐标按照从小到大（从大到小）的顺序排序]]></description><category></category></item><item><title><![CDATA[线段树扫描线——HDU1542&&POJ1151-Atlantis]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52700024</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52700024</guid><author>hahaAll</author><pubDate>Thu, 29 Sep 2016 10:59:54 +0800</pubDate><description><![CDATA[Atlantis
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11407    Accepted Submission(s): 4841


Problem Description
There are several an]]></description><category></category></item><item><title><![CDATA[最大流问题——有源汇有上下界的最小流sgu176  Flow construction]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52683495</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52683495</guid><author>hahaAll</author><pubDate>Tue, 27 Sep 2016 18:18:29 +0800</pubDate><description><![CDATA[对于这个题，，我只想知道为什么数组开大一点点（没有达到MLE的程度）返回的结果是PE？？很搞不懂……貌似题目中说了N的范围，，但是M的范围好像没说？（也许眼瞎了……）

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namesp]]></description><category></category></item><item><title><![CDATA[最大流问题——无源汇有上下界最大流  sgu194 Reactor Cooling]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52683076</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52683076</guid><author>hahaAll</author><pubDate>Tue, 27 Sep 2016 17:52:50 +0800</pubDate><description><![CDATA[关于最大流问题，看到了一篇非常好的博客：点击打开链接

这里面讲的都非常详细了，所以就不多说了，贴代码主要是因为习惯了自己的代码风格……
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

const]]></description><category></category></item><item><title><![CDATA[bzoj1036: [ZJOI2008]树的统计Count——树链剖分]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52348175</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52348175</guid><author>hahaAll</author><pubDate>Sun, 28 Aug 2016 22:06:27 +0800</pubDate><description><![CDATA[bzoj1036: [ZJOI2008]树的统计Count：http://www.lydsy.com/JudgeOnline/problem.php?id=1036



1036: [ZJOI2008]树的统计Count
Time Limit: 10 Sec  Memory Limit: 
162 M
[Submit][Status][Discuss]
Description]]></description><category></category></item><item><title><![CDATA[hdu3397Sequence operation--线段树]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52230886</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52230886</guid><author>hahaAll</author><pubDate>Wed, 17 Aug 2016 20:02:21 +0800</pubDate><description><![CDATA[hdu3397Sequence operation：http://acm.hdu.edu.cn/showproblem.php?pid=3397


Sequence operation
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)


Problem Desc]]></description><category></category></item><item><title><![CDATA[UESTC360Another LCIS]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52174177</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52174177</guid><author>hahaAll</author><pubDate>Wed, 10 Aug 2016 18:16:40 +0800</pubDate><description><![CDATA[UESTC360 Another LCIS:http://acm.uestc.edu.cn/#/problem/show/360



Another LCIS




Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)


Submit 
Status]]></description><category></category></item><item><title><![CDATA[hdu3308LCIS]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/52152893</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/52152893</guid><author>hahaAll</author><pubDate>Mon, 08 Aug 2016 16:24:44 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3308
LCIS
Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6448    Accepted Submission(s): 2799

]]></description><category></category></item><item><title><![CDATA[求最短路条数之类的~~~]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/51581943</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/51581943</guid><author>hahaAll</author><pubDate>Fri, 03 Jun 2016 21:58:16 +0800</pubDate><description><![CDATA[Flowery Trails
时间限制: 1 Sec  内存限制: 128 MB

题目描述



In order to attract more visitors, the manager of  a national park had the idea of planting ﬂowers along both sides of the popular trails, whic]]></description><category></category></item><item><title><![CDATA[poj3414——bfs+路径打印]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/50927327</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/50927327</guid><author>hahaAll</author><pubDate>Fri, 18 Mar 2016 23:16:55 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=3414                                                                                                                                              

Pots




Time Limit]]></description><category></category></item><item><title><![CDATA[hdu4725The Shortest Path in Nya Graph---spfa求最短路]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/50868074</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/50868074</guid><author>hahaAll</author><pubDate>Sat, 12 Mar 2016 22:43:26 +0800</pubDate><description><![CDATA[hdu4725The Shortest Path in Nya Graphhttp://acm.hdu.edu.cn/showproblem.php?pid=4725


The Shortest Path in Nya Graph
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Oth]]></description><category></category></item><item><title><![CDATA[poj2240Arbitrage_spfa & bellman-Ford]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/50845609</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/50845609</guid><author>hahaAll</author><pubDate>Thu, 10 Mar 2016 12:49:02 +0800</pubDate><description><![CDATA[poj2240Arbitrage:http://poj.org/problem?id=2240


Arbitrage




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 19216
 
Accepted: 8128





Description

Arbitrage]]></description><category></category></item><item><title><![CDATA[poj3660Cow Contest_Floyd传递闭包]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/50836020</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/50836020</guid><author>hahaAll</author><pubDate>Wed, 09 Mar 2016 15:54:12 +0800</pubDate><description><![CDATA[poj3660Cow Contest:http://poj.org/problem?id=3660


Cow Contest




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 8991
 
Accepted: 5050





Description

N (1 ≤]]></description><category></category></item><item><title><![CDATA[poj3268Silver Cow Party——最短路变形]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/50809227</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/50809227</guid><author>hahaAll</author><pubDate>Sat, 05 Mar 2016 16:01:51 +0800</pubDate><description><![CDATA[poj3268Silver Cow Party：http://poj.org/problem?id=3268


Silver Cow Party




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 16780
 
Accepted: 7663





Descriptio]]></description><category></category></item><item><title><![CDATA[poj1797Heavy Transportation——Dijkstra变形]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/50805531</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/50805531</guid><author>hahaAll</author><pubDate>Fri, 04 Mar 2016 21:19:09 +0800</pubDate><description><![CDATA[poj1797Heavy Transportation：http://poj.org/problem?id=1797


Heavy Transportation




Time Limit: 3000MS
 
Memory Limit: 30000K


Total Submissions: 26885
 
Accepted: 7210





De]]></description><category></category></item><item><title><![CDATA[poj2253Frogger——最短路变形]]></title><link>https://blog.youkuaiyun.com/hahaAll/article/details/50805066</link><guid>https://blog.youkuaiyun.com/hahaAll/article/details/50805066</guid><author>hahaAll</author><pubDate>Fri, 04 Mar 2016 20:13:41 +0800</pubDate><description><![CDATA[poj2253Frogge：http://poj.org/problem?id=2253


Frogger




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 33131
 
Accepted: 10651





Description

Freddy Frog i]]></description><category></category></item></channel></rss>