摘要：
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 78529Accepted Submission(s): 21... 阅读全文
摘要：
Quoit Design Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34742 Accepted Submission(s): 9066 阅读全文
摘要：
Number SequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 115124Accepted Submission(s): 27959... 阅读全文
摘要：
下面两题的方法是一样的都是并查集的应用；并查集的重点就是找到祖先节点的过程。重点在这里：int find(int x){ return p[x] == x ? x : p[x] = find( p[x]); }不断地递归，递归到找到自己是自己的祖先为止。并且把它取接到那个祖先节点上；这样可以节省空间... 阅读全文
摘要：
Jungle RoadsTime Limit:1000MSMemory Limit:10000KTotal Submissions:19852Accepted:9136DescriptionThe Head Elder of the tropical island of Lagrishan has ... 阅读全文
摘要：
搬寝室Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18724Accepted Submission(s): 6338Problem Descri... 阅读全文
摘要：
le-interchange-newline">6650Falling AntsAnts make up 10% of the total world animal tissue. Thetotal biomass of all the ants on Earth is roughly equal ... 阅读全文
摘要：
这道题是真的很简单，只需要用优先队列以单位价值作为排序规则就可以解决。FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): ... 阅读全文
摘要：
Doing Homework againTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7494Accepted Submission(s): 44... 阅读全文
摘要：
两天的集训下来在慢慢的摸索过程中逐渐有了一点领会。先是讲的dfs深度优先搜索法，然后是bfs广度优先搜索法，但是在代码书写的过程却总是出现一些问题。DFS的主要思想是利用递归，每次递归都会带入下一个节点数据。而BFS则是使用队列或是优先队列进行广度优先的搜索方式。以下列出一道杭电的题目。Oil De... 阅读全文