摘要：
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include "runCLock.h"#define DEBUG_INSERT 1#define DEBUG_BUBBLE 1#define DEBUG_QUICK 1#define DEBUG_SELECT 1#define DEBUG_HEAP 1#define DEBUG_MERGE 1#define DEBUG_SHELL 1using namespace std;// d 阅读全文
摘要：
Color a TreeTime Limit:1000MSMemory Limit:30000KTotal Submissions:5832Accepted:1930DescriptionBob is very interested in the data structure of a tree. A tree is a directed graph in which a special node is singled out, called the "root" of the tree, and there is a unique path from the root t 阅读全文
摘要：
POJ推荐50题1.标记“难”和“稍难”的题目可以看看，思考一下，不做要求，当然有能力的同学可以直接切掉。2.标记为A and B的题目是比较相似的题目，建议大家两个一起做，可以对比总结，且二者算作一个题目。3.列表中大约有70个题目。大家选做其中的50道，且每类题目有最低数量限制。4.这里不少题目在BUPT ACM FTP上面都有代码，请大家合理利用资源。5. 50个题目要求每个题目都要写总结，养成良好的习惯。9.这个列表的目的在于让大家对各个方面的算法有个了解，也许要求有些苛刻，教条，请大家谅解，这些是我们这些年的经验总结，所以也请大家尊重我们的劳动成果。第一类 动态规划(至少6题，247 阅读全文
摘要：
Heavy TransportationTime Limit:3000MSMemory Limit:30000KTotal Submissions:14202Accepted:3748DescriptionBackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu 阅读全文
摘要：
Blue JeansTime Limit:1000MSMemory Limit:65536KTotal Submissions:7671Accepted:3184DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated.As an IBM 阅读全文
摘要：
Jungle RoadsTime Limit:1000MSMemory Limit:10000KTotal Submissions:14632Accepted:6541DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the 阅读全文
摘要：
Drainage DitchesTime Limit:1000MSMemory Limit:10000KTotal Submissions:38934Accepted:14449DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. 阅读全文
摘要：
NetworkTime Limit:1000MSMemory Limit:10000KTotal Submissions:6365Accepted:2988DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bidirectional 阅读全文
摘要：
参考了july的非递归解法，一下是自己的代码：//递归和非递归遍历Tree// 1// / \// 2 3// / \ / \// 4 5 6 7//Pre-Order: 1 2 4 5 3 6 7//In-Order: 4 2 5 1 6 3 7//Post-Order:4 5 2 6 7 3 1#include <iostream>#include <cstdio>#include <stack>using namespace std;typedef struct node{ int val; str... 阅读全文
摘要：
Octal FractionsTime Limit:1000MSMemory Limit:10000KTotal Submissions:4968Accepted:2670DescriptionFractions in octal (base 8) notation can be expressed exactly in decimal notation. For example, 0.75 in octal is 0.953125 (7/8 + 5/64) in decimal. All octal numbers of n digits to the right of the octal 阅读全文