2015年5月21日
Problem N HDU 2612 Find a way (两次BFS求最值)
摘要： N -Find a wayTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 2612DescriptionPass a year learning in Hangzhou... 阅读全文
posted @ 2015-05-21 23:48 BYYB_0506 阅读(132) 评论(0) 推荐(0)
UVA 1600 Patrol Robot(BFS扩展)
摘要： Patrol RobotTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %lluSubmitStatusDescriptionA robot has to patrol around a rectangular area whi... 阅读全文
posted @ 2015-05-21 01:14 BYYB_0506 阅读(272) 评论(0) 推荐(0)