流水依依

希望朋友们有个好的身体，开开心心工作与学习。
博客园 首页 新随笔 联系 订阅 管理

2013年9月3日 #

hnust Fuel Stops
摘要： FuelStopsTime Limit: 20000ms, Special Time Limit:50000ms, Memory Limit:32768KBTotal submit users: 25, Accepted users: 21Problem 11344 : No special judgementProblem description You are required to take a circular tour of a given set of cities: start at a certain city, visit each city once, and retur. 阅读全文
posted @ 2013-09-03 21:07 流水依依 阅读(284) 评论(0) 推荐(0)

询问给定图中树的棵数
摘要： TreesTime Limit: 2500ms, Special Time Limit:6000ms, Memory Limit:32768KBProblem 11348 : No special judgementProblem descriptionA graph consists of a set of vertices and edges between pairs of vertices. Two vertices are connected if there is a path (subset of edges) leading from one vertex to anothe. 阅读全文
posted @ 2013-09-03 18:49 流水依依 阅读(291) 评论(0) 推荐(0)