摘要： Constructing RoadsTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 12Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some r 阅读全文

摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11576Accepted Submission(s): 4353 Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect t 阅读全文

摘要： 还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20992Accepted Submission(s): 9360 Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测 阅读全文

摘要： 继续畅通工程Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10914Accepted Submission(s): 4763 Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。现得到城镇道路统计表，表中列出了任意两城镇间修建道路的费用，以及该道路是否已经修通的状态。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含 阅读全文

摘要： Lowest BitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6591Accepted Submission(s): 4836 Problem DescriptionGiven an positive integer A (1 #include #include #include #include using namespace std;int n;int lowbit(int x){ return x & (- x);}int 阅读全文

摘要： RewardTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3013Accepted Submission(s): 905 Problem DescriptionDandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a t 阅读全文

摘要： const int MAXN = 1000010;//二叉树的节点的结构体的表示形式struct Node{ char data; struct Node *leftchild,*rightchild;}BTree;//栈的结构体的表示形式struct sstack{ BTree *map_stack[MAXN]; int top;}Stack;//队列的结构体的表示形式struct qqueue{ BTree *map_queue[MAXN]; int head; int tail;}Queue;//创建二叉树，利用递归的方法BTree *BuildTree(){ char char_str 阅读全文

摘要： GCD AgainTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2109Accepted Submission(s): 833 Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest? No? Oh, you must do this when you want 阅读全文

摘要： Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10329Accepted Submission(s): 6841 Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a mi 阅读全文

摘要： HangOverTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8185Accepted Submission(s): 3379 Problem DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We& 阅读全文