2014年3月10日
csu 1356 Catch bfs（vector）
摘要： 1356: CatchTime Limit: 2 SecMemory Limit: 128 MBSubmit: 96Solved: 40[Submit][Status][Web Board]DescriptionA thief is running away!We can consider the city where he locates as an undirected graph in which nodes stand for crosses and edges stand for streets. The crosses are labeled from 0 to N–1. The 阅读全文
posted @ 2014-03-10 21:59 芷水 阅读(203) 评论(0) 推荐(0) 编辑
csu 1365 双向链表模拟超时
摘要： 1365: Play with ChainTime Limit: 5 SecMemory Limit: 128 MBSubmit: 21Solved: 5[Submit][Status][Web Board]DescriptionYaoYao is fond of playing his chains. He has a chain containing n diamonds on it. Diamonds are numbered from 1 to n.At first, the diamonds on the chain is a sequence: 1, 2, 3, …, n.He w 阅读全文
posted @ 2014-03-10 18:03 芷水 阅读(231) 评论(0) 推荐(0) 编辑