摘要:
hdu2255奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3453Accepted Submission(s): 1489Probl... 阅读全文
摘要:
多校联赛第三场(hdu4888)Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1320Accep... 阅读全文
摘要:
多校联赛第一场(hdu4862)JumpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 644Accepted Submission(s): 275... 阅读全文
摘要:
hdu4871Shortest-path treeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 130712/130712 K (Java/Others)Total Submission(s): 382Accepted Submission(... 阅读全文
摘要:
hdu4760Cube number on a treeTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 878Accepted Submissi... 阅读全文
摘要:
poj2114BoatherdsTime Limit:2000MSMemory Limit:65536KTotal Submissions:1195Accepted:387DescriptionBoatherds Inc. is a sailing company operating in the ... 阅读全文
摘要:
poj1741TreeTime Limit:1000MSMemory Limit:30000KTotal Submissions:10012Accepted:3024DescriptionGive a tree with n vertices,each edge has a length(posit... 阅读全文
摘要:
poj1300Door ManTime Limit:1000MSMemory Limit:10000KTotal Submissions:2020Accepted:801DescriptionYou are a butler in a large mansion. This mansion has ... 阅读全文
摘要:
1041John's tripTime Limit:1000MSMemory Limit:65536KTotal Submissions:6993Accepted:2302Special JudgeDescriptionLittle Johnny has got a new car. He deci... 阅读全文
摘要:
POJ1637Sightseeing tourTime Limit:1000MSMemory Limit:10000KTotal Submissions:7483Accepted:3115DescriptionThe city executive board in Lund wants to con... 阅读全文
摘要:
2337CatenymsTime Limit:1000MSMemory Limit:65536KTotal Submissions:9454Accepted:2486DescriptionA catenym is a pair of words separated by a period such ... 阅读全文
摘要:
CodeTime Limit:1000MSMemory Limit:65536KTotal Submissions:1943Accepted:706DescriptionKEY Inc., the leading company in security hardware, has developed... 阅读全文
摘要:
#include"stdio.h"#include"string.h"#include"queue"#include"stack"#include"iostream"#include"string"#include"map"#include"stdlib.h"#define inf 99999999... 阅读全文
摘要:
WatchcowTime Limit:3000MSMemory Limit:65536KTotal Submissions:5902Accepted:2538Special JudgeDescriptionBessie's been appointed the new watch-cow for t... 阅读全文
摘要:
poj1273Drainage DitchesTime Limit:1000MSMemory Limit:10000KTotal Submissions:54962Accepted:20960DescriptionEvery time it rains on Farmer John's fields... 阅读全文
摘要:
【HDU】1213 How Many Tables 根蒂根基并查集★1272 小希的迷宫 根蒂根基并查集★1325&&poj1308 Is It A Tree? 根蒂根基并查集★1856 More is better 根蒂根基并查集★1102 Constructing Roads 根蒂根基最小生成树... 阅读全文
摘要:
poj2117ElectricityTime Limit:5000MSMemory Limit:65536KTotal Submissions:3603Accepted:1213DescriptionBlackouts and Dark Nights (also known as ACM++) is... 阅读全文
摘要:
省赛总结首先说说比赛时的情况吧,刚开始的时候我的任务就是翻译英文题目,找出比较水的题目,他们两个直接找中文水题切,其实每次比赛我们都是这样配合的,由于他们的判题系统一开始存在问题,交的正确的代码给判错了,这就让我们感到很不爽了,不过没关系,因为其他人提交的也是错的,然后就接着做其他题目,大约出了三道... 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=2433TravelTime Limit: 10000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s... 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=3007题意:给出平面上的一些点,要求用一个最小的圆,把所有的点包围起来。 最小覆盖圆, 增量法假设圆O是前i-1个点得最小覆盖圆,加入第i个点,如果在圆内或边上则什么也不做。否,新得到的最小覆盖圆肯定经过第i个点。... 阅读全文