qiaomm的个人博客

HDOJ 1711 Number Sequence—KMP算法题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1711题目描述：Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 <= M <= 10000, 1 <...

HDOJ 1875—畅通工程再续（最小生成树普利姆算法）题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1875题目描述：相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的小岛中，当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖，发展首先要解决的问题当然是交通问题，政府决定实现百岛湖的全畅通！经过考察小组RPRu...

HDOJ之还是畅通工程—最小生成树（普利姆）题目描述：某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( < 100 )；随...

Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主被关在一个两层的迷宫里，迷宫的入口是S（0，0，0），公主的位置用...

A + B Problem IIA + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 509429 Accepted Submission(s): 97805Problem DescriptionI...

Problem Description“Well, it seems the first problem is too easy. I will let you know how foolish you are later.” feng5166 says.“The second problem is, given an positive integer N, we define an equa...

Zball in Tina TownTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1931 Accepted Submission(s): 978Problem Description Tina Town is a frie

Fxx and stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 766 Accepted Submission(s): 336Problem Description Young theoretical compute

BallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 906 Accepted Submission(s): 532Problem Description ZZX has a sequence of boxes numbered

Rikka with Parenthesis IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 603    Accepted Submission(s): 344Problem DescriptionAs

physicsTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 413    Accepted Submission(s): 265Problem DescriptionThere are n balls on

Problem DescriptionZZX has a sequence of boxes numbered 1,2,...,n. Each box can contain at most one ball.You are given the initial configuration of the balls. For 1≤i≤n, if the i-th box

Problem DescriptionBeing an ACMer requires knowledge in many fields, because problems in this contest may use physics, biology, and even musicology as background. And now in this problem, you are being

Problem DescriptionA stack is a data structure in which all insertions and deletions of entries are made at one end, called the "top" of the stack. The last entry which is inserted is the first one