【hdu 1034 (preprocess optimization, property of division to avoid if, decreasing order process) 分类： hdoj 2015-06-16 13:32 39人阅读 评论(0) 收藏】的更多相关文章

hdu 1034 (preprocess optimization, property of division to avoid if, decreasing order process) 分类： hdoj 2015-06-16 13:32 39人阅读 评论(0) 收藏

IMO, version 1 better than version 2, version 2 better than version 3. make some preprocess to make you code simple and efficient. Here divide the input by 2, so you don't have to do dividsion on each loop. version 1 is best thanks to http://www.cnbl…

Hdu 1507 Uncle Tom's Inherited Land* 分类： Brush Mode 2014-07-30 09:28 112人阅读 评论(0) 收藏

Uncle Tom's Inherited Land* Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1869    Accepted Submission(s): 777 Special Judge Problem Description Your old uncle Tom inherited a piece of land fr…

hdu1171 Big Event in HDU（01背包） 2016-05-28 16:32 75人阅读 评论(0) 收藏

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34556    Accepted Submission(s): 11986 Problem Description Nowadays, we all know that Computer College is the biggest departmen…

hdu, KMP algorithm, linear string search algorithm, a nice reference provided 分类： hdoj 2015-07-18 13:40 144人阅读 评论(0) 收藏

reference: Rabin-Karp and Knuth-Morris-Pratt Algorithms By TheLlama– TopCoder Member https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-string-searching-algorithms/ // to be improved #include <cstdio> #include <…

hdu 1712, multiple-choice knapsack, 分类： hdoj 2015-07-18 13:25 152人阅读 评论(0) 收藏

reference: 6.4 knapsack in Algorithms(算法概论), Sanjoy Dasgupta University of California, San Diego Christos Papadimitriou University of California at Berkeley Umesh Vazirani University of California at Berkeley the unbounded knapsack and 0-1 knapsack a…

hdu 1047 (big integer sum, fgets or scanf, make you func return useful infos) 分类： hdoj 2015-06-18 08:21 39人阅读 评论(0) 收藏

errors made, boundary conditions, <= vs < , decreasing vs increasing , ++, –, '0'/'1' vs 0/1 prototype of sum, return the starting position of c-style string containing the sum, just like sprintf return number of characters successfully read. p1=sum…

Hdu 1429 胜利大逃亡(续) 分类： Brush Mode 2014-08-07 17:01 92人阅读 评论(0) 收藏

胜利大逃亡(续) Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 22   Accepted Submission(s) : 10 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Ignatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜…

Hdu 1009 FatMouse' Trade 分类： Translation Mode 2014-08-04 14:07 74人阅读 评论(0) 收藏

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 42953    Accepted Submission(s): 14336 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats g…

HDU 1532 Drainage Ditches 分类： Brush Mode 2014-07-31 10:38 82人阅读 评论(0) 收藏

Drainage Ditches Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8861    Accepted Submission(s): 4141 Problem Description Every time it rains on Farmer John's fields, a pond forms over Bessie's…

hdu 1232, disjoint set, linked list vs. rooted tree, a minor but substantial optimization for path c 分类： hdoj 2015-07-16 17:13 116人阅读 评论(0) 收藏

three version are provided. disjoint set, linked list version with weighted-union heuristic, rooted tree version with rank by union and path compression, and a minor but substantial optimization for path compression version FindSet to avoid redundanc…