2013年12月3日

J - Goblin Wars BFS

摘要： J -Goblin WarsTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 5992Appoint description:DescriptionACM International Collegiate Programming Contest, Asia-Amritapuri Site, 2011Problem J: Goblin WarsThe wizards and witches of Hogwarts School of Witchcraft foun 阅读全文

posted @ 2013-12-03 19:52 keep trying 阅读(372) 评论(0) 推荐(0) 编辑

二分 + DP

摘要： A -MAGRIDTime Limit:10000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionACM International Collegiate Programming Contest, Asia-Amritapuri Site, 2011Problem A: MAGRIDThanks a lot for helping Harry Potter in finding the Sorcerer's Stone of Immortality i 阅读全文

posted @ 2013-12-03 16:46 keep trying 阅读(235) 评论(0) 推荐(0) 编辑

E - Levko and Array DP + e二分

摘要： E -Levko and ArrayTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionLevko has an array that consists of integers:a1, a2, ... , an. But he doesn’t like this array at all.Levko thinks that the beauty of the arrayadirectly depends on value 阅读全文

posted @ 2013-12-03 14:13 keep trying 阅读(243) 评论(0) 推荐(0) 编辑

导航