2013年9月11日
hdu 4725 The Shortest Path in Nya Graph(堆+dij,最短路，5级)
摘要： The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 193Accepted Submissi... 阅读全文
posted @ 2013-09-11 20:12 剑不飞 阅读(191) 评论(0) 推荐(0) 编辑
hdu 4717 The Moving Points(三分，4级)
摘要： The Moving PointsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 103Accepted Submission(s): 35Prob... 阅读全文
posted @ 2013-09-11 18:40 剑不飞 阅读(195) 评论(0) 推荐(0) 编辑
POJ 3693 Maximum repetition substring （求重复次数最多的连续子串，4级）
摘要： E - Maximum repetition substringCrawling in process...Crawling failedTime Limit:1000MSMemory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus A... 阅读全文
posted @ 2013-09-11 10:47 剑不飞 阅读(162) 评论(0) 推荐(0) 编辑