jianupc

 

2013年1月21日

poj 1861 Network 最小生成树 kruskal

摘要： NetworkTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 10959Accepted: 4174Special JudgeDescriptionAndrew 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 阅读全文

posted @ 2013-01-21 21:01 shijianupc 阅读(170) 评论(0) 推荐(0)

poj 2349 Arctic Network 最小生成树prim算法

摘要： Arctic NetworkTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6645Accepted: 2270DescriptionThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every o 阅读全文

posted @ 2013-01-21 16:17 shijianupc 阅读(197) 评论(0) 推荐(0)

poj 3295 Tautology 构造法

摘要： TautologyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6949Accepted: 2653DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these s 阅读全文

posted @ 2013-01-21 10:59 shijianupc 阅读(166) 评论(0) 推荐(0)

导航