2016 年 1月 22 日随笔档案 - 一骑绝尘去

摘要： The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 9759 Accepted: 4053Description We will use the follow... 阅读全文

posted @ 2016-01-22 20:10 一骑绝尘去阅读(132) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 2000MS Memory Limit: 65536K Description Every cow's dream is to become the most popular cow in the herd. In a herd of ... 阅读全文

posted @ 2016-01-22 17:10 一骑绝尘去阅读(186) 评论(0) 推荐(0) 编辑

摘要： Going from u to v or from v to u? Time Limit: 2000MS Memory Limit: 65536K Description In order to make their sons brave, Jiaj... 阅读全文

posted @ 2016-01-22 14:37 一骑绝尘去阅读(353) 评论(0) 推荐(0) 编辑

绝尘