
树
文章平均质量分 78
剑不飞
时刻思考,找准方向,坚定执行,永不服输(AC才是王道。)
展开
-
USACO section 3.1 Agri-Net(最小生成树,prim)
Agri-NetRuss Cox Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer Jo原创 2012-10-08 21:10:32 · 579 阅读 · 0 评论 -
UVA 10600 ACM Contest and Blackout(次小树,3级)
F - ACM Contest and BlackoutTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-10-08)DescriptionProbl原创 2013-10-16 15:21:07 · 887 阅读 · 0 评论 -
UVA 11865 Stream My Contest(最小树形图,4级)
C - Stream My ContestTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionG原创 2013-10-16 15:19:25 · 849 阅读 · 0 评论 -
HDU 4081 Qin Shi Huang's National Road System(次小树,4级)
A - Qin Shi Huang's National Road SystemTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-08-20)De原创 2013-10-16 15:15:29 · 657 阅读 · 0 评论 -
UVA 11354 Bond(prim+LCA,4级)
B - BondTime Limit:8000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)DescriptionBNEXT原创 2013-10-15 11:58:06 · 815 阅读 · 0 评论 -
poj 1679 The Unique MST(最小树不唯一的判定)
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16068 Accepted: 5566DescriptionGiven a connected undirected graph, tell if its minimum s原创 2013-02-16 15:51:58 · 494 阅读 · 0 评论 -
ZOJ 1542 poj 1861 Network(并查集+最小树)
NetworkTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in原创 2013-02-14 16:15:05 · 539 阅读 · 0 评论 -
ZOJ 1203 Swordfish(Kruskal 最小树)
SwordfishTime Limit: 2 Seconds Memory Limit: 65536 KB There exists a world within our worldA world beneath what we call cyberspace.A world protected by firewalls,passwords and the most原创 2013-02-14 15:27:34 · 563 阅读 · 0 评论 -
CF-27E - Number With The Given Amount Of Divisors(枚举+dfs)
E - Number With The Given Amount Of DivisorsCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPractice CodeForces 27E原创 2013-02-08 16:17:12 · 855 阅读 · 0 评论 -
ZOJ 1011 NTA(二叉树+vector)
NTATime Limit: 2 Seconds Memory Limit: 65536 KB The NTA (Non-deterministic Tree Automata) is a kind of tree structure device. The device is built in a set of operating rules. With these原创 2012-11-06 19:58:48 · 1096 阅读 · 0 评论 -
UVALive 3887 Slim Span(枚举+MST,4级)
E - Slim SpanTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-06-01)DescriptionGiven an undirec原创 2013-10-16 13:44:40 · 738 阅读 · 0 评论