摘要： 最小生成树的简单运用E -NetworkingTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uPOJ 1287DescriptionYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connec 阅读全文

摘要： B -NetworkTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uPOJ 1861DescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each wo 阅读全文

摘要： 1203 SwordfishA -SwordfishTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %lluZOJ 1203There exists a world within our worldA world beneath what we call cyberspace.A world protected by firewalls,passwords and the most advancedsecurity systems.In this world we hideour deepest secrets,o 阅读全文

摘要： 链接：QS NetworkG -QS NetworkTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionSunny Cup 2003 - Preliminary RoundApril 20th, 12:00 - 17:00Problem E: QS NetworkIn the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicate with each other 阅读全文

摘要： K -Yukari's BirthdayTime Limit:6000MSMemory Limit:0KB64bit IO Format:%lld & %lluUVALive 6076DescriptionToday is Yukari'sn-th birthday. Ran and Chen hold a celebration party for her. Now comes the most important part, birthday cake! But it's a big challenge for them to placencandles o 阅读全文

摘要： E -Conquer a New RegionE -Conquer a New RegionTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 6070DescriptionThe wheel of the history rolling forward, our king conquered a new region in a distant continent.There areNtowns (numbered from 1 toN) in this regi 阅读全文

摘要： A：连续子串和贪心题，枚举每一个数字作为结束点。保留前i位的前缀和sum[i]，对于第i为结束的合法序列，其值为sum[i]-sum[i-K]，sum[i]-sum[i-K-1]，...，sum[i]-sum[0]，那么我们只需要对每一个 i 保留sum[0]到sum[i-K]的最小值即可。View Code 1 #include <stdio.h> 2 #include <string.h> 3 #include <iostream> 4 using namespace std; 5 typedef long long LL; 6 7 const int 阅读全文

摘要： Bone Collector IITime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1158Accepted Submission(s): 566Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have 阅读全文

摘要： M -Perfect Pth PowersTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionWe say that x is a perfect square if, for some integer b, x = b2. Similarly, x is a perfect cube if, for some integer b, x = b3. More generally, x is a perfect pth power if, for some int 阅读全文

摘要： http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=3&problem=38&mosmsg=Submission+received+with+ID+11541056Ecological Bin PackingTime limit: 3.000 secondsBackground背景Bin packing, or the placement of objects of certain weights into diff 阅读全文