<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u013180220的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u013180220</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u013180220]]></copyright><item><title><![CDATA[HDU  1068  Girls and Boys   【二分图+增广路】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38610311</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38610311</guid><author>u013180220</author><pubDate>Sat, 16 Aug 2014 09:10:25 +0800</pubDate><description><![CDATA[Girls and Boys
Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7559    Accepted Submission(s): 3463



Problem Description

the secon]]></description><category></category></item><item><title><![CDATA[HDU 1151 Air Raid  【二分图+增广路】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38610283</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38610283</guid><author>u013180220</author><pubDate>Sat, 16 Aug 2014 09:05:59 +0800</pubDate><description><![CDATA[Air Raid
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3365    Accepted Submission(s): 2214



Problem Description

Consider a town w]]></description><category></category></item><item><title><![CDATA[HDU 2063 过山车 【二分图+增广路】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38610255</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38610255</guid><author>u013180220</author><pubDate>Sat, 16 Aug 2014 08:59:44 +0800</pubDate><description><![CDATA[过山车
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10977    Accepted Submission(s): 4834



Problem Description

RPG girls今天和大家一起去游乐场玩]]></description><category></category></item><item><title><![CDATA[KMP算法详解  【KMP】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38558481</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38558481</guid><author>u013180220</author><pubDate>Thu, 14 Aug 2014 14:53:03 +0800</pubDate><description><![CDATA[作者 ： v_JULY_v
出处：http://blog.youkuaiyun.com/v_JULY_v/]]></description><category></category></item><item><title><![CDATA[SDUTOJ  1500   Message Flood  【STL】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38557851</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38557851</guid><author>u013180220</author><pubDate>Thu, 14 Aug 2014 14:09:57 +0800</pubDate><description><![CDATA[Description

Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and benefits people a lot". However, If you ask Merlin this question on t]]></description><category></category></item><item><title><![CDATA[SDUTOJ 2127  树-堆结构练习——合并果子之哈夫曼树   【STL】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38557789</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38557789</guid><author>u013180220</author><pubDate>Thu, 14 Aug 2014 14:06:53 +0800</pubDate><description><![CDATA[Description

 在一个果园里，多多已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。
每一次合并，多多可以把两堆果子合并到一起，消耗的体力等于两堆果子的重量之和。可以看出，所有的果子经过n-1次合并之后，就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所消耗体力之和。




Input

 第一行是一个整数n(1]]></description><category></category></item><item><title><![CDATA[POJ  2418  Hardwood Species 【STL】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38556079</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38556079</guid><author>u013180220</author><pubDate>Thu, 14 Aug 2014 11:18:40 +0800</pubDate><description><![CDATA[Description

Hardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter. 
America's temperate climates produce forests with hu]]></description><category></category></item><item><title><![CDATA[POJ 3096 Surprising Strings 【STL】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38541465</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38541465</guid><author>u013180220</author><pubDate>Wed, 13 Aug 2014 20:00:22 +0800</pubDate><description><![CDATA[Description

The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pairs are different. A string is surprising]]></description><category></category></item><item><title><![CDATA[POJ 1061 青蛙的约会 【扩展GCD】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38510549</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38510549</guid><author>u013180220</author><pubDate>Tue, 12 Aug 2014 09:30:01 +0800</pubDate><description><![CDATA[Description

两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着某个方向跳下去，总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上，不然是永远都不可能碰面]]></description><category></category></item><item><title><![CDATA[HDU 1505 City Game 【扫描线】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38510233</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38510233</guid><author>u013180220</author><pubDate>Tue, 12 Aug 2014 09:17:43 +0800</pubDate><description><![CDATA[City GameCrawling in process...
Crawling failed
Time Limit:3000MS    
Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit

Status 


Description


Bob is a strategy game programming ]]></description><category></category></item><item><title><![CDATA[ZOJ 1109 Language of FatMouse 【STL】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38459451</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38459451</guid><author>u013180220</author><pubDate>Sat, 09 Aug 2014 19:50:15 +0800</pubDate><description><![CDATA[Description

We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.
Input Specification]]></description><category></category></item><item><title><![CDATA[HDU 1754  I Hate It 【线段树】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38453309</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38453309</guid><author>u013180220</author><pubDate>Sat, 09 Aug 2014 09:02:24 +0800</pubDate><description><![CDATA[Description

很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。       

这让很多学生很反感。        

不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。       
        



Input

本题目包含多组测试，请处理到文件]]></description><category></category></item><item><title><![CDATA[HDU 1166 敌兵布阵 【线段树】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38443691</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38443691</guid><author>u013180220</author><pubDate>Fri, 08 Aug 2014 19:36:40 +0800</pubDate><description><![CDATA[Problem Description
C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视。]]></description><category></category></item><item><title><![CDATA[POJ 1006 Biorhythms 【中国剩余定理】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38396763</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38396763</guid><author>u013180220</author><pubDate>Wed, 06 Aug 2014 10:04:35 +0800</pubDate><description><![CDATA[Description
Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they ]]></description><category></category></item><item><title><![CDATA[HDU 1061  Rightmost Digit 【快速求幂】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38396115</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38396115</guid><author>u013180220</author><pubDate>Wed, 06 Aug 2014 09:31:13 +0800</pubDate><description><![CDATA[Description

Given a positive integer N, you should output the most right digit of N^N.

 



Input

The input contains several test cases. The first line of the input is a single integer T ]]></description><category></category></item><item><title><![CDATA[产生冠军  HDU 2094 【拓扑排序】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38341875</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38341875</guid><author>u013180220</author><pubDate>Fri, 01 Aug 2014 20:45:31 +0800</pubDate><description><![CDATA[Description

有一群人，打乒乓球比赛，两两捉对撕杀，每两个人之间最多打一场比赛。
球赛的规则如下：
如果A打败了B，B又打败了C，而A与C之间没有进行过比赛，那么就认定，A一定能打败C。
如果A打败了B，B又打败了C，而且，C又打败了A，那么A、B、C三者都不可能成为冠军。
根据这个规则，无需循环较量，或许就能确定冠军。你的任务就是面对一群比赛选手，在经过了若干场撕杀之后，]]></description><category></category></item><item><title><![CDATA[HDU 1869 六度分离 【floyd】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38337533</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38337533</guid><author>u013180220</author><pubDate>Fri, 01 Aug 2014 15:41:45 +0800</pubDate><description><![CDATA[Description

1967年，美国著名的社会学家斯坦利・米尔格兰姆提出了一个名为“小世界现象(small world phenomenon)”的著名假说，大意是说，任何2个素不相识的人中间最多只隔着6个人，即只用6个人就可以将他们联系在一起，因此他的理论也被称为“六度分离”理论(six degrees of separation)。虽然米尔格兰姆的理论屡屡应验，一直也有很多社会学家对其]]></description><category></category></item><item><title><![CDATA[HDU 2066 一个人的旅行 【floyd】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38337441</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38337441</guid><author>u013180220</author><pubDate>Fri, 01 Aug 2014 15:39:02 +0800</pubDate><description><![CDATA[Description

虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯看电影，去阳明山上看海芋，去纽约纯粹看雪景，去巴黎喝咖啡写信，去北京探望孟姜女……眼看寒假就快到了，这么一大段时间，可不能浪]]></description><category></category></item><item><title><![CDATA[HDU 1701 Binary Tree Traversals   【二叉树】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38316485</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38316485</guid><author>u013180220</author><pubDate>Thu, 31 Jul 2014 14:20:42 +0800</pubDate><description><![CDATA[Description

A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most important w]]></description><category></category></item><item><title><![CDATA[数据结构实验之二叉树的建立与遍历 【二叉树】]]></title><link>https://blog.youkuaiyun.com/u013180220/article/details/38311955</link><guid>https://blog.youkuaiyun.com/u013180220/article/details/38311955</guid><author>u013180220</author><pubDate>Thu, 31 Jul 2014 09:38:21 +0800</pubDate><description><![CDATA[数据结构实验之二叉树的建立与遍历Crawling in process...
Crawling failed
Time Limit:1000MS    
Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit 
Status 


Description
       已知一个按先序序列输入的字符序列，如abc,]]></description><category></category></item></channel></rss>