08 2012 档案

HOJ---12498 Indomie[组合数学]
摘要：IndomieTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 14, Accepted users: 14Problem 12498 : Special judgeProbl... 阅读全文
posted @ 2012-08-31 21:20 max_xbw 阅读(281) 评论(0) 推荐(0)
POJ---2777 Count Color[线段树-求整段区间]
摘要：Count ColorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 27655Accepted: 8263DescriptionChosen Problem Solving and Program design as an opti... 阅读全文
posted @ 2012-08-31 12:01 max_xbw 阅读(253) 评论(0) 推荐(0)
POJ---3013 Big Christmas Tree[数据超大，谨慎小心]
摘要：Big Christmas TreeTime Limit: 3000MSMemory Limit: 131072KTotal Submissions: 17317Accepted: 3644DescriptionChristmas is coming to KCM city. Suby the lo... 阅读全文
posted @ 2012-08-29 23:02 max_xbw 阅读(282) 评论(0) 推荐(0)
Central Europe Regional Contest 2011
摘要：UniqueEncryptionKeysTime Limit: 30000ms, Special Time Limit:75000ms, Memory Limit:65536KBTotal submit users: 19, Accepted users: 15Problem 12484 : Spe... 阅读全文
posted @ 2012-08-29 15:34 max_xbw 阅读(407) 评论(0) 推荐(0)
POJ---2449 Remmarguts' Date[K短路入门题（Dijkstra()||Spfa()+A*）]
摘要：Remmarguts' DateTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 15399Accepted: 4202Description"Good man never makes girls wait or breaks an a... 阅读全文
posted @ 2012-08-29 01:26 max_xbw 阅读(346) 评论(0) 推荐(0)
A*算法入门
摘要：转自：http://www.cppblog.com/mythit/archive/2009/04/19/80492.aspx在看下面这篇文章之前，先介绍几个理论知识，有助于理解A*算法。启发式搜索：启发式搜索就是在状态空间中的搜索对每一个搜索的位置进行评估，得到最好的位置，再从这个位置进行搜索直到目... 阅读全文
posted @ 2012-08-28 22:14 max_xbw 阅读(387) 评论(0) 推荐(0)
优先队列用法
摘要：转自：http://www.cppblog.com/shyli/archive/2007/04/06/21366.html在优先队列中，优先级高的元素先出队列。标准库默认使用元素类型的qi;通过,greater>qi2;其中第二个参数为容器类型。第二个参数为比较函数。故示例2中输出结果为：2 3 5... 阅读全文
posted @ 2012-08-28 20:44 max_xbw 阅读(199) 评论(0) 推荐(0)
HDOJ---1045 Fire Net[二分图-匈牙利算法]
摘要：Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3676Accepted Submission(s): 2114Problem De... 阅读全文
posted @ 2012-08-27 17:08 max_xbw 阅读(405) 评论(0) 推荐(0)
POJ---1860 Currency Exchange[套汇问题SPFA()正权回路的判定]
摘要：Currency ExchangeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 13730Accepted: 4716DescriptionSeveral currency exchange points are working i... 阅读全文
posted @ 2012-08-26 21:19 max_xbw 阅读(433) 评论(0) 推荐(0)
ZOJ---3175 Number of Containers[数学题]
摘要：Number of ContainersTime Limit: 1 Second Memory Limit: 32768 KBFor two integers m and k, k is said to be a container of m if k is divisible by m. Giv... 阅读全文
posted @ 2012-08-26 18:19 max_xbw 阅读(1107) 评论(0) 推荐(0)
HDOJ---2601 An easy problem[水题]
摘要：An easy problemTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4072Accepted Submission(s): 968Prob... 阅读全文
posted @ 2012-08-25 11:29 max_xbw 阅读(279) 评论(0) 推荐(0)
HDOJ---1116 Play on Words[并查集+欧拉回路]
摘要：Play on WordsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2938Accepted Submission(s): 935Probl... 阅读全文
posted @ 2012-08-25 10:47 max_xbw 阅读(514) 评论(0) 推荐(0)
位运算
摘要：各种位运算的使用=== 1. and运算 === and运算通常用于二进制取位操作，例如一个数 and 1的结果就是取二进制的最末位。这可以用来判断一个整数的奇偶，二进制的最末位为0表示该数为偶数，最末位为1表示该数为奇数。 相同位的两个数字都为1，则为1；若有一个不为1，则为0。 00111... 阅读全文
posted @ 2012-08-24 23:11 max_xbw 阅读(187) 评论(0) 推荐(0)
HDOJ---1166 敌兵布阵[线段树求和]||HDOJ---1754 I Hate It[线段树求最大值]
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19372Accepted Submission(s): 8440Problem Descr... 阅读全文
posted @ 2012-08-24 22:32 max_xbw 阅读(344) 评论(0) 推荐(0)
HDOJ---1301 Jungle Roads[最小生成树--Prim（）]
摘要：Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2920Accepted Submission(s): 2064Proble... 阅读全文
posted @ 2012-08-24 12:13 max_xbw 阅读(201) 评论(0) 推荐(0)
HDOJ---1281 棋盘游戏[匈牙利（最大匹配）+枚举]
摘要：棋盘游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1286Accepted Submission(s): 737Problem Descrip... 阅读全文
posted @ 2012-08-24 11:18 max_xbw 阅读(234) 评论(0) 推荐(0)
HDOJ---2159 FATE[DP-背包问题]
摘要：FATETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3984Accepted Submission(s): 1763Problem Descri... 阅读全文
posted @ 2012-08-23 17:29 max_xbw 阅读(385) 评论(0) 推荐(0)
HDOJ---2571 命运[DP]
摘要：命运Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4701Accepted Submission(s): 1675Problem Descript... 阅读全文
posted @ 2012-08-23 16:32 max_xbw 阅读(410) 评论(0) 推荐(0)
HDOJ---1568 Fibonacci[公式求前四位数]
摘要：FibonacciTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2113Accepted Submission(s): 979Problem De... 阅读全文
posted @ 2012-08-23 01:01 max_xbw 阅读(371) 评论(0) 推荐(0)
Fibonacci序列
摘要：转自：http://mces89.yo2.cn/articles/fibonacci%e5%ba%8f%e5%88%97.html[定理1] 标准Fibonacci序列（即第0项为0，第1项为1的序列）当N大于1时，一定有f(N)和f(N-1)互质其实，结合“互质”的定义，和一个很经典的算法就可以轻... 阅读全文
posted @ 2012-08-23 00:17 max_xbw 阅读(449) 评论(0) 推荐(0)
POJ---1791 Parallelogram Counting[数学题-平行四边形求个数]
摘要：Parallelogram CountingTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 5361Accepted: 1794DescriptionThere are n distinct points in the plane, ... 阅读全文
posted @ 2012-08-23 00:07 max_xbw 阅读(668) 评论(0) 推荐(0)
HDOJ---2577 How to Type[DP（两个DP数组）]
摘要：How to TypeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1855Accepted Submission(s): 876Problem ... 阅读全文
posted @ 2012-08-22 16:16 max_xbw 阅读(239) 评论(0) 推荐(0)
HDOJ---1847 Good Luck in CET-4 Everybody![巴什博弈]
摘要：Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2513Accepted Submissi... 阅读全文
posted @ 2012-08-21 23:52 max_xbw 阅读(361) 评论(0) 推荐(0)
寻找必败态——一类博弈问题的快速解法
摘要：转自：http://www.cnblogs.com/Knuth/archive/2009/09/05/1561005.html博弈是信息学和数学试题中常会出现的一种类型，算法灵活多变是其最大特点，而其中有一类试题更是完全无法用常见的博弈树来进行解答。 寻找必败态即为针对此类试题给出一种解题思路。 此... 阅读全文
posted @ 2012-08-21 23:30 max_xbw 阅读(490) 评论(0) 推荐(0)
博弈论（二）：Sprague-Grundy函数
摘要：转自：http://www.cnblogs.com/Knuth/archive/2009/09/05/1561007.html上一期的文章里我们仔细研究了Nim游戏，并且了解了找出必胜策略的方法。但如果把Nim的规则略加改变，你还能很快找出必胜策略吗？比如说：有n堆石子，每次可以从第1堆石子里取1颗... 阅读全文
posted @ 2012-08-21 23:30 max_xbw 阅读(371) 评论(0) 推荐(0)
HDOJ---1846 Brave Game[巴什博弈]
摘要：Brave GameTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3158Accepted Submission(s): 2092Problem ... 阅读全文
posted @ 2012-08-21 22:34 max_xbw 阅读(381) 评论(0) 推荐(0)
ACM-博弈论
摘要：有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流... 阅读全文
posted @ 2012-08-21 21:35 max_xbw 阅读(564) 评论(0) 推荐(0)
【转】ACM博弈常识汇总
摘要：博弈常识汇总有一种很有意思的游戏，就是有物体若干堆，可所以火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我公民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深切的数学道理。下面我们来解析一下要如何才干够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品... 阅读全文
posted @ 2012-08-21 21:32 max_xbw 阅读(1092) 评论(0) 推荐(0)
HDOJ---2546 饭卡[DP01背包问题]
摘要：饭卡Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4160Accepted Submission(s): 1410Problem Descript... 阅读全文
posted @ 2012-08-21 20:53 max_xbw 阅读(339) 评论(0) 推荐(0)
HDOJ---1599 find the mincost route[floyd 判最小环]
摘要：find the mincost routeTime Limit: 1000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 886Accepted Submission(s): 3... 阅读全文
posted @ 2012-08-20 00:37 max_xbw 阅读(290) 评论(0) 推荐(0)
HDOJ---1063 大数的n次方
摘要：ExponentiationTime Limit: 1000/500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4275Accepted Submission(s): 1167Probl... 阅读全文
posted @ 2012-08-19 15:23 max_xbw 阅读(565) 评论(0) 推荐(0)
HDOJ---1711 Number Sequence[KMP模版]
摘要：Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6147Accepted Submission(s): 2758Pr... 阅读全文
posted @ 2012-08-18 21:16 max_xbw 阅读(240) 评论(0) 推荐(0)
HDOJ---1267 下沙的沙子2[DP或卡特兰数]
摘要：下沙的沙子有几粒？Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1554Accepted Submission(s): 790Problem De... 阅读全文
posted @ 2012-08-18 14:59 max_xbw 阅读(294) 评论(0) 推荐(0)
KMP算法
摘要：转自：http://www.cnblogs.com/dolphin0520/archive/2011/08/24/2151846.html在介绍KMP算法之前，先介绍一下BF算法。一.BF算法 BF算法是普通的模式匹配算法，BF算法的思想就是将目标串S的第一个字符与模式串P的第一个字符进行匹配，若相... 阅读全文
posted @ 2012-08-18 12:26 max_xbw 阅读(327) 评论(0) 推荐(0)
HDOJ---1261 字串数[组合+大数]
摘要：字串数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1877Accepted Submission(s): 367Problem Descript... 阅读全文
posted @ 2012-08-18 10:48 max_xbw 阅读(623) 评论(0) 推荐(0)
HDOJ---1061 Rightmost Digit[简单数学题]
摘要：Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19050Accepted Submission(s): 7329Pr... 阅读全文
posted @ 2012-08-18 01:36 max_xbw 阅读(233) 评论(0) 推荐(0)
传说中效率最高的最大流算法(Dinic) [转]
摘要：转自：http://www.cnblogs.com/zhuangli/archive/2008/09/07/1259527.html#1310894呵呵,又从DK那偷代码了,好兴奋哈,以下是这个算法的简单介绍,不过我用它去解决HDU的1532 竟然TLE,郁闷.到时候再继续问问DK吧...so 烦躁... 阅读全文
posted @ 2012-08-17 17:20 max_xbw 阅读(513) 评论(0) 推荐(0)
POJ---1273 Drainage Ditches[EK()]
摘要：Drainage DitchesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 41645Accepted: 15583DescriptionEvery time it rains on Farmer John's fields, a... 阅读全文
posted @ 2012-08-16 23:35 max_xbw 阅读(184) 评论(0) 推荐(0)
POJ---3259 Wormholes[SPFA模版]
摘要：WormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20567Accepted: 7314DescriptionWhile exploring his many farms, Farmer John has discov... 阅读全文
posted @ 2012-08-16 21:59 max_xbw 阅读(197) 评论(0) 推荐(0)
kmp 模版
摘要：1 void get_next(char *str) 2 { 3 int len=strlen(str); 4 next[0]=-1; 5 int j=0,k=-1;//k记录next[]; 6 7 while(j<len) 8 { 9 ... 阅读全文
posted @ 2012-08-16 21:08 max_xbw 阅读(194) 评论(0) 推荐(0)
最短路算法(Shortest Paths Algorithm)
摘要：假如你有一张地图，地图上给出了每一对相邻城市的距离，从一个地点到另外一个地点，如何找到一条最短的路？ 最短路算法要解决的就是这类问题。定义：给定一个有(无)向图，每一条边有一个权值 w，给定一个起始点 S 和终止点 T ，求从 S 出发走到 T 的权值最小路径，即为最短路径。最短路算法依赖一种性质：... 阅读全文
posted @ 2012-08-15 23:46 max_xbw 阅读(2039) 评论(0) 推荐(2)
有趣的A+B
摘要：转自：http://www.cnblogs.com/litstrong/archive/2011/05/19/2051516.html计算a+b，不使用+,-,*,/，用^实现加法，用&实现进位，代码如下，复杂度log级别的，有意思哈~ 1 #include 2 #include 3 #incl... 阅读全文
posted @ 2012-08-15 22:42 max_xbw 阅读(222) 评论(0) 推荐(0)
网络流题目
摘要：View Code 【HDU】1532 Drainage Ditches(基础) [最大流]3549 Flow Problem(基础) [最大流]3572 Task Schedule [最大流]任务分配,判断满流2732 Leapin' Lizards(难) [最大流]3338 Kakuro Ext... 阅读全文
posted @ 2012-08-15 17:40 max_xbw 阅读(892) 评论(0) 推荐(0)
HDOJ---1054 Strategic Game[求最小顶点覆盖-无向图]
摘要：Strategic GameTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2892Accepted Submission(s): 1206Pr... 阅读全文
posted @ 2012-08-15 17:07 max_xbw 阅读(743) 评论(0) 推荐(0)
HDOJ---1532||POJ---1273 Drainage Ditches[最大流-模版]
摘要：Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4515Accepted Submission(s): 2108Pr... 阅读全文
posted @ 2012-08-15 11:45 max_xbw 阅读(216) 评论(0) 推荐(0)
最大流问题[转]
摘要：转自：http://www.cppblog.com/mythit/archive/2009/04/19/80470.html最近又复习了下最大流问题，每次看这部分的内容都会有新的收获。可以说最大流问题的资料网上一搜一大把，根本没有必要自己写；但是大部分资料上的专业术语太多了，初学很难理解，至少我当年... 阅读全文
posted @ 2012-08-14 17:15 max_xbw 阅读(293) 评论(0) 推荐(0)
HDOJ---2236 无题II[二分枚举+匈牙利]
摘要：无题IITime Limit: 2000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 571Accepted Submission(s): 296Problem Descript... 阅读全文
posted @ 2012-08-14 16:14 max_xbw 阅读(215) 评论(0) 推荐(0)
HDOJ---2175 汉诺塔IX[递推]
摘要：汉诺塔IXTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 437Accepted Submission(s): 250Problem Descrip... 阅读全文
posted @ 2012-08-14 12:01 max_xbw 阅读(320) 评论(0) 推荐(0)
HDOJ---3829 Cat VS Dog[匈牙利]
摘要：Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1728Accepted Submission(s): 581Problem ... 阅读全文
posted @ 2012-08-14 11:34 max_xbw 阅读(227) 评论(0) 推荐(0)
由二分图匹配匈牙利算法总结的一些知识[转]
摘要：转自：http://www.cnblogs.com/celia01/archive/2012/04/02/2430260.html除了准备离散考试外，算是第一次仔细学习图论和网络流的相关知识了。以前只知道用最大二分匹配的模板，今天就把理论知识好好总结一下，以免以后忘记。从网上搜罗了一些知识，有一下几... 阅读全文
posted @ 2012-08-14 09:49 max_xbw 阅读(283) 评论(0) 推荐(0)
spfa_队列
摘要：转自：http://www.cnblogs.com/pushing-my-way/archive/2012/08/05/2624271.htmlspfa:1.当给定的图存在负权边时，Dijkstra等算法便没有了用武之地，而Bellman-Ford算法的复杂度又过高，SPFA算法便派上用场了.2.我... 阅读全文
posted @ 2012-08-14 09:47 max_xbw 阅读(408) 评论(0) 推荐(0)
HDOJ---2036 过山车[匈牙利算法]
摘要：过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5139Accepted Submission(s): 2260Problem Descrip... 阅读全文
posted @ 2012-08-14 00:02 max_xbw 阅读(218) 评论(0) 推荐(0)
HDOJ---1151 Air Raid[匈牙利算法：最小路径覆盖数=原图顶点数–二分图最大匹配数]
摘要：Air RaidTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1859Accepted Submission(s): 1191Problem De... 阅读全文
posted @ 2012-08-13 23:05 max_xbw 阅读(567) 评论(0) 推荐(0)
HDOJ---1300 Pearls[DP（先证明出相互代替不会跳跃）]
摘要：PearlsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 767Accepted Submission(s): 325Problem Descri... 阅读全文
posted @ 2012-08-13 18:09 max_xbw 阅读(351) 评论(0) 推荐(0)
HDOJ---1074 Doing Homework[DP+状态压缩]
摘要：Doing HomeworkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3150Accepted Submission(s): 1203Prob... 阅读全文
posted @ 2012-08-12 18:33 max_xbw 阅读(350) 评论(0) 推荐(0)
HDOJ---1856 More is better[并查集求节点最多的树的节点数量]
摘要：More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 6438Accepted Submission(s): 2383Pr... 阅读全文
posted @ 2012-08-12 17:23 max_xbw 阅读(359) 评论(0) 推荐(0)
HDOJ---1273 漫步森林[图论]
摘要：漫步森林Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1051Accepted Submission(s): 703Problem Descrip... 阅读全文
posted @ 2012-08-12 13:42 max_xbw 阅读(390) 评论(0) 推荐(0)
HDOJ---1787 GCD Again[欧拉函数的延伸]
摘要：GCD AgainTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1493Accepted Submission(s): 560Problem De... 阅读全文
posted @ 2012-08-12 00:43 max_xbw 阅读(229) 评论(0) 推荐(0)
HDOJ---1217 Arbitrage[弗洛伊德算法]
摘要：ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2369Accepted Submission(s): 1082Problem D... 阅读全文
posted @ 2012-08-11 21:36 max_xbw 阅读(261) 评论(0) 推荐(0)
HDOJ---1719 Friend[数论]
摘要：FriendTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1139Accepted Submission(s): 558Problem Descr... 阅读全文
posted @ 2012-08-11 09:58 max_xbw 阅读(221) 评论(0) 推荐(0)
HDOJ---1863 畅通工程[Prim（）]
摘要：畅通工程Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9935Accepted Submission(s): 3916Problem Descri... 阅读全文
posted @ 2012-08-11 01:01 max_xbw 阅读(189) 评论(0) 推荐(0)
HDOJ---1102 Constructing Roads[Prim()]
摘要：Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7661Accepted Submission(s): 2861... 阅读全文
posted @ 2012-08-10 23:41 max_xbw 阅读(182) 评论(0) 推荐(0)
HDOJ---2824 The Euler function[欧拉函数]
摘要：The Euler functionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1896Accepted Submission(s): 769P... 阅读全文
posted @ 2012-08-10 21:07 max_xbw 阅读(383) 评论(0) 推荐(0)
HDOJ---1573 X问题[中国剩余定理]
摘要：X问题Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1792Accepted Submission(s): 534Problem Descript... 阅读全文
posted @ 2012-08-10 16:31 max_xbw 阅读(458) 评论(0) 推荐(0)
HDOJ---1142 A Walk Through the Forest[DFS（记忆化搜索）+Dijkstra]
摘要：A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3312Accepted Submission(s... 阅读全文
posted @ 2012-08-10 14:20 max_xbw 阅读(272) 评论(0) 推荐(0)
POJ ---2236 Wireless Network[简单并查集]
摘要：Wireless NetworkTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 12427Accepted: 5236DescriptionAn earthquake takes place in Southeast Asia. T... 阅读全文
posted @ 2012-08-10 10:58 max_xbw 阅读(210) 评论(0) 推荐(0)
POJ----1182 食物链[并查集]
摘要：食物链Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 30510Accepted: 8883Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编... 阅读全文
posted @ 2012-08-09 22:43 max_xbw 阅读(198) 评论(0) 推荐(0)
POJ---2492 A Bug's Life[并查集]
摘要：A Bug's LifeTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 21679Accepted: 7071DescriptionBackground Professor Hopper is researching the sex... 阅读全文
posted @ 2012-08-09 20:46 max_xbw 阅读(332) 评论(0) 推荐(0)
并查集的基础知识
摘要：最近有学到一种更加通用的方法，因为它还适用于1182食物链中有三种集合相关联的情况，而且此法更为简洁。只需加一个rank数组，表示两种派别，值为0和1，初始化为0.查询时如果两人属于同一集合并且属于派别相同就输出In the same gang.否则输出In different gangs.不属于同... 阅读全文
posted @ 2012-08-09 12:10 max_xbw 阅读(150) 评论(0) 推荐(0)
POJ---2524 Ubiquitous Religions[简单并查集]
摘要：Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 17762Accepted: 8653DescriptionThere are so many different religions in th... 阅读全文
posted @ 2012-08-09 10:55 max_xbw 阅读(271) 评论(0) 推荐(0)
POJ---1611 The Suspects[并查集]
摘要：The SuspectsTime Limit: 1000MSMemory Limit: 20000KTotal Submissions: 15580Accepted: 7450DescriptionSevere acute respiratory syndrome (SARS), an atypic... 阅读全文
posted @ 2012-08-08 22:50 max_xbw 阅读(202) 评论(0) 推荐(0)
并查集的初级应用及进阶
摘要：转自：http://blog.csdn.net/pure_life/article/details/2922118一、精华精华提炼1： 内容：并查集就是树的孩子表示法的应用。 解释：对于下图所示树，它的孩子表示法为： belg[5]=2, belg[6]=2, belg[7]=2; belg[2... 阅读全文
posted @ 2012-08-08 22:03 max_xbw 阅读(240) 评论(0) 推荐(0)
2012-8-8 还是总结一下吧。
摘要：今天廖老师搞一场比赛，一般。先说说做题的流程吧。刚开始第一题看了下，有点小激动，前天刚做过，虽然当时自己没有做出来，但是还是去找了解题报告，正如昨天看到的那篇ACM心得一样，确实有点功利性。不过今天比赛的时候，还是能够很快的写出来，交了WA了几次，忘了一种特殊情况，郁闷，后来才想到- -，就这样，花... 阅读全文
posted @ 2012-08-08 18:12 max_xbw 阅读(188) 评论(0) 推荐(0)
[转]ACM心得——(写的很好，留着警示自己)
摘要：[转自：http://blog.csdn.net/hss871838309/article/details/7376381#]这个非原创、、、、、但是，为了让更多人看到，无奈的原创一下、、、写的很好，虽然真正学习算法(说的好听是学算法，不好听就是A题)近一年了，但是，学习的效率非常低，最近才稍稍掌握... 阅读全文
posted @ 2012-08-07 20:47 max_xbw 阅读(847) 评论(1) 推荐(0)
杂心得
摘要：慢慢充实吧。对于bfs和dfs的选择：更倾向于bfs，因为bfs能够保证一定能搜到最后的结果bfs：一般都是从终点开始搜，一直搜到起点dfs：二分枚举：在情况小，且单调的情况下，可以用二分枚举队列：默认容量为32图论知识树：http://zh.wikipedia.org/wiki/Bellman-F... 阅读全文
posted @ 2012-08-07 20:46 max_xbw 阅读(139) 评论(0) 推荐(0)
弗洛伊德算法
摘要：弗洛伊德算法维基百科，自由的百科全书Floyd-Warshall算法（Floyd-Warshall algorithm）是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。Floyd-Warshall算法的时间复杂度为，空间复杂度为。[编辑... 阅读全文
posted @ 2012-08-07 17:20 max_xbw 阅读(323) 评论(0) 推荐(0)
HDOJ---1272 小希的迷宫[并查集]
摘要：小希的迷宫Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14112Accepted Submission(s): 4284Problem Desc... 阅读全文
posted @ 2012-08-07 16:40 max_xbw 阅读(612) 评论(0) 推荐(0)
POJ---1703 Find them, Catch them [并查集]
摘要：Find them, Catch themTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21732Accepted: 6461DescriptionThe police office in Tadu City decides to ... 阅读全文
posted @ 2012-08-07 11:38 max_xbw 阅读(166) 评论(0) 推荐(0)
HDOJ---1068 Girls and Boys[匈牙利算法]
摘要：Girls and BoysTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4471Accepted Submission(s): 1944Pr... 阅读全文
posted @ 2012-08-06 16:43 max_xbw 阅读(231) 评论(0) 推荐(0)
匈牙利算法
摘要：转自：http://hi.baidu.com/kukumayas/blog/item/a43c39384af633d3b311c753.html设想一个公司里有A, B, C三种工具, 有员工1, 2, 3, 4号. 这四位员工分别能操作的机型为情况为: 1: A, B 2: A, C 3: ... 阅读全文
posted @ 2012-08-06 11:03 max_xbw 阅读(827) 评论(0) 推荐(0)
二分匹配总结（匈牙利算法+最大权+最小权）
摘要：转自：http://dingdongsheng.cool.blog.163.com/blog/static/1186187552009431405995/ 前段时间为了省赛，我专门花了半个月来“专研”二部图，目前对二部图还是有一点点心得，所以就记录下来，希望对某些人有用。 开始我对二部图一窍不通，于... 阅读全文
posted @ 2012-08-06 10:38 max_xbw 阅读(4563) 评论(0) 推荐(1)
HDOJ---1753 高精度浮点型相加
摘要：大明A+BTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4887Accepted Submission(s): 1613Problem Descr... 阅读全文
posted @ 2012-08-05 22:36 max_xbw 阅读(326) 评论(1) 推荐(0)
HDOJ---1269 迷宫城堡[强连通分量]
摘要：迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3368Accepted Submission(s): 1444Problem Descri... 阅读全文
posted @ 2012-08-05 19:07 max_xbw 阅读(408) 评论(0) 推荐(0)
求强连通分量的Tarjan算法[转]
摘要：求强连通分量的Tarjan算法[有向图强连通分量]在有向图G中，如果两个顶点间至少存在一条路径，称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。非强连通图有向图的极大强连通子图，称为强连通分量(strongly connected co... 阅读全文
posted @ 2012-08-05 16:15 max_xbw 阅读(689) 评论(0) 推荐(0)
HDOJ---3371 Connect the Cities[kruskal算法]
摘要：Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4439Accepted Submission(s): 1298... 阅读全文
posted @ 2012-08-05 14:49 max_xbw 阅读(208) 评论(0) 推荐(0)
POJ并查集小结(转)
摘要：并查集小结并查集大体分为三个：普通的并查集，带种类的并查集，扩展的并查集（主要是必须指定合并时的父子关系，或者统计一些数据，比如此集合内的元素数目。）POJ-1182经典的种类并查集POJ-1308用并查集来判断一棵树。。注意空树也是树，死人也是人。POJ-1611裸地水并查集POJ-1703种类并... 阅读全文
posted @ 2012-08-04 21:12 max_xbw 阅读(504) 评论(0) 推荐(0)
HDOJ---1869 六度分离[Dijkstra()算法]
摘要：六度分离Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1589Accepted Submission(s): 626Problem Descrip... 阅读全文
posted @ 2012-08-04 10:07 max_xbw 阅读(306) 评论(0) 推荐(0)
HDOJ---3790 最短路径问题[Dijkstra算法||SPFA]
摘要：最短路径问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4820Accepted Submission(s): 1446Problem Desc... 阅读全文
posted @ 2012-08-03 23:42 max_xbw 阅读(235) 评论(0) 推荐(0)
HDOJ---1285 确定比赛名次[拓扑排序]
摘要：确定比赛名次Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5896Accepted Submission(s): 2203Problem Desc... 阅读全文
posted @ 2012-08-03 23:11 max_xbw 阅读(183) 评论(0) 推荐(0)
HDOJ---1875 畅通工程再续[Prim()算法]
摘要：畅通工程再续Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7210Accepted Submission(s): 2163Problem Desc... 阅读全文
posted @ 2012-08-03 17:58 max_xbw 阅读(220) 评论(0) 推荐(0)
HDOJ---2066 一个人的旅行[Dijkstra算法]
摘要：一个人的旅行Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9503Accepted Submission(s): 3244Problem Desc... 阅读全文
posted @ 2012-08-03 01:06 max_xbw 阅读(212) 评论(0) 推荐(0)
HDOJ---2544 最短路[Dijkstra算法]
摘要：最短路Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14129Accepted Submission(s): 6037Problem Descri... 阅读全文
posted @ 2012-08-02 17:40 max_xbw 阅读(209) 评论(0) 推荐(0)
HDOJ---1874 畅通工程续[最短路径问题-Dijkstra算法]
摘要：转自：http://www.wutianqi.com/?p=1894畅通工程续Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13049Accept... 阅读全文
posted @ 2012-08-02 17:24 max_xbw 阅读(199) 评论(0) 推荐(0)
并查集中的路径压缩
摘要：转自：http://www.cnblogs.com/naix-x/archive/2012/06/13/2548228.html做最小生成树的时候，用kruskal做稠密图。。怎么都是超时，等等试一下Prim看看能不能过。。期间优化下并查集的部分，看的杭电上的文档，文档上讲的很好，讲了两种方式。 1... 阅读全文
posted @ 2012-08-02 16:13 max_xbw 阅读(603) 评论(4) 推荐(1)
HDOJ---1162 Eddy's picture[求最短路prim||kruskal算法]
摘要：Eddy's pictureTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4035Accepted Submission(s): 1993Prob... 阅读全文
posted @ 2012-08-01 16:41 max_xbw 阅读(233) 评论(0) 推荐(0)