剑不飞

摘要： F -EscapeTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:Description2012 If this is the end of the w... 阅读全文

摘要： E -Rain on your ParadeTime Limit:3000MSMemory Limit:165535KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionYou’re giving a pa... 阅读全文

摘要： C -Cat VS DogTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThe zoo have N cats and M do... 阅读全文

摘要： D -Treasure HuntingTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionDo you like treasure h... 阅读全文

摘要： A -National TreasuresTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThe great hall of th... 阅读全文

摘要： 回顾和加深所学算法。主要回顾用途及使用方法。图论方面： 1.dfs,bfs 2.强连通，点双连通，边双连通，2-sat 3.匈牙利算法km,以及不等式解 4.网络流，费用流 5.最短路，SPFA，dijstra, floay,斯坦纳树，最短路的DP类型判圈，环等 6.LCA。 7.... 阅读全文

摘要： Color a TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 854Accepted Submission(s): 281Problem ... 阅读全文

摘要： E -charge-stationTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4435Appoint description:DescriptionThere ar... 阅读全文

摘要： C -lockerTime Limit:3000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionA password locker with N digits,... 阅读全文

摘要： Apocalypse SomedayTime Limit:1000MSMemory Limit:131072KTotal Submissions:1385Accepted:632DescriptionThe number 666 is considered to be the occult “num... 阅读全文