【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) 收藏】的更多相关文章

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…

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 1031 (partial sort problem, nth_element, stable_partition, lambda expression) 分类： hdoj 2015-06-15 17:47 26人阅读 评论(0) 收藏

partial sort. first use std::nth_element to find pivot, then use std::stable_partition with the pivot to partition the largest k, whose indices are in acsending order, print them in reverse order. p.s. lambda expression is also used. STL is powerful.…

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 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…

[leetcode] Reverse Linked List 分类： leetcode 算法 2015-07-09 18:44 2人阅读 评论(0) 收藏

反转链表:比较简单的问题,可以遍历也可以递归. # Definition for singly-linked list. class ListNode: def __init__(self, x): self.val = x self.next = None class Solution: # @param {ListNode} head # @return {ListNode} def reverseList(self, head): if head!=None: list1=head lis…

one recursive approach for 3, hdu 1016 (with an improved version) , permutations, N-Queens puzzle 分类： hdoj 2015-07-19 16:49 86人阅读 评论(0) 收藏

one recursive approach to solve hdu 1016, list all permutations, solve N-Queens puzzle. reference: the video of stanford cs106b lecture 10 by Julie Zelenski https://www.youtube.com/watch?v=NdF1QDTRkck // hdu 1016, 795MS #include <cstdio> #include &l…

leetcode N-Queens/N-Queens II, backtracking, hdu 2553 count N-Queens, dfs 分类： leetcode hdoj 2015-07-09 02:07 102人阅读 评论(0) 收藏

for the backtracking part, thanks to the video of stanford cs106b lecture 10 by Julie Zelenski for the nice explanation of recursion and backtracking, highly recommended. in hdu 2553 cout N-Queens solutions problem, dfs is used. // please ignore, bel…

hdu 1053 (huffman coding, greedy algorithm, std::partition, std::priority_queue ) 分类： hdoj 2015-06-18 19:11 22人阅读 评论(0) 收藏

huffman coding, greedy algorithm. std::priority_queue, std::partition, when i use the three commented lines, excution time increase to 15ms from 0ms, due to worse locality? thanks to http://acm.hdu.edu.cn/discuss/problem/post/reply.php?action=support…

hdu 1052 (greedy algorithm) 分类： hdoj 2015-06-18 16:49 35人阅读 评论(0) 收藏

thanks to http://acm.hdu.edu.cn/discuss/problem/post/reply.php?action=support&postid=19638&messageid=1&deep=0 for the test case provided. below is an excerpt data 8 11 9 8 8 8 4 3 2 11 8 8 8 8 4 3 2 answer 800 #include <cstdio> #include…