摘要：
CannonTime Limit: 1000msMemory Limit: 65535KBThis problem will be judged onHDU. Original ID:449964-bit integer IO format:%I64d Java class name:MainIn ... 阅读全文
摘要：
D-CityTime Limit: 1000msMemory Limit: 65535KBThis problem will be judged onHDU. Original ID:449664-bit integer IO format:%I64d Java class name:MainLux... 阅读全文
摘要：
Mayor's postersTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged onUVA. Original ID:1058764-bit integer IO format:%lld Java class na... 阅读全文
摘要：
Board GameAccept: 54Submit: 151Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionFat brother and Maze are playing a kind of special (hent... 阅读全文
摘要：
Airport ExpressTime Limit: 1000msMemory Limit: 131072KBThis problem will be judged onUVA. Original ID:1137464-bit integer IO format:%lld Java class na... 阅读全文
摘要：
Poor HanamichiTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem De... 阅读全文
摘要：
A Plug for UNIXTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:108764-bit integer IO format:%lld Java class name... 阅读全文
摘要：
Print ArticleTime Limit: 3000msMemory Limit: 65536KBThis problem will be judged onHDU. Original ID:350764-bit integer IO format:%I64d Java class name:... 阅读全文
摘要：
1319 玩具装箱题目描述DescriptionP教授要去看奥运，但是他舍不下他的玩具，于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压缩，其可以将任意物品变成一堆，再放到一种特殊的一维容器中。P教授有编号为1...N的N件玩具，第i件玩具经过压缩后变成一维长度为Ci.为了方便整理，P教授要... 阅读全文
摘要：
Anniversary partyTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:234264-bit integer IO format:%lld Java class na... 阅读全文