cokomowang的专栏

要求最小的开销，意思就是最小的木块要放在最后切，这样最小的木块就会经历最多次数的累加。而最小的木块 一定还伴随着另一块木块，同理它应该也是次小的木块。所以就要每次找出最小的和次小的木块，将其加和，再将和累积到开销变量ans上。如果每合成一次木块就要排序一次的话会有点耗时，而且每次合成完之后分别用来代表最小和次小木块的下标的mii1，mii2就已经废弃不用了，这时

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3001题目大意：n个城市之间有m条路，经过每条路径都有一定的花费，当然有些城市是不可达的。遍历所有的城市，并且每个城市最多只能遍历2次，求取花费的最小费用并输出，如果找不到这样的路径，输出-1。(n解题思路：由于n是小于10的，所以这个题目可以使用状态压缩

AtlantisTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17448 Accepted: 6652DescriptionThere are several ancient Greek texts that contain descriptions o

Testing the CATCHERTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15180 Accepted: 5585DescriptionA military contractor for the Department of Defense

CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 28958 Accepted: 9828DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3..

PollutionTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3904 Accepted: 1034DescriptionThe managers of a chemical plant, which is notorious for its hi

Universal Question Answering SystemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1229    Accepted Submission(s): 213Problem Descript

BUY LOW, BUY LOWERTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8466 Accepted: 2930DescriptionThe advice to "buy low" is half the formula to success

Number GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3078 Accepted: 1235DescriptionChristine and Matt are playing an exciting game they just invente

FenceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3586 Accepted: 1087DescriptionA team of k (1 <= K <= 100) workers should paint a fence which cont

Jury CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24812 Accepted: 6464 Special JudgeDescriptionIn Frobnia, a far-away country, the ve

Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7793 Accepted: 2423DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"

Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4057 Accepted: 1696DescriptionBessie is such a hard-working cow. In fact, she is so focused

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 75081 Accepted: 27855DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升

D - EightTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe 15-puzzle has been around for over 100 years; even if you don't k

#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define maxn 16000005#define mod

题目描述：   有N个数，每次从左到右选取M个数，第一行选取每个区间中的最小值输出，第二行选取最大值并输出。 解题思路：   看单调队列的时候推荐了这个题，所以自然就是单调队列的类型了。然后这个是典型的，固定k区间队列的。套用的本质思想是，如求最小值： 考虑这样的一个问题，在某个区间当中如果存在某两个元素A,B，满足A的下标小于B的下标，A的值大于B的值，那么A这个

Moving TablesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25839 Accepted: 8600DescriptionThe famous ACM (Advanced Computer Maker) Company has rented

Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23065 Accepted: 8197DescriptionWe have received an order from Pizoor Communications In

生日蛋糕Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14120 Accepted: 4971Description7月17日是Mr.W的生日，ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕，每层都是一个圆柱体。 设从下往上数第i(1 R