![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
bnu oj
Wss0130
这个作者很懒,什么都没留下…
展开
-
Defense Lines
D. Defense Lines Time Limit: 3000ms Case Time Limit: 3000ms Memory Limit: 131072KB 64-bit integer IO format: %lld Java class name: Main Submit Status Font Size: + - [原创 2012-08-29 22:17:55 · 569 阅读 · 1 评论 -
Game
G. Game Time Limit: 3000ms Case Time Limit: 3000ms Memory Limit: 131072KB 64-bit integer IO format: %lld Java class name: Main SubmitStatus Font Size: + - [PDF Link] T原创 2012-08-29 22:18:37 · 460 阅读 · 2 评论 -
BNUOJ 3013 Ancient Keyboard
Ancient Keyboard Time Limit: 1000ms Memory Limit: 65536KB This problem will be judged on PKU. Original ID: 2894 64-bit integer IO format: %lld Java class name: Main Prev Submit原创 2012-08-31 23:31:27 · 448 阅读 · 1 评论 -
BNUOJ Best SMS To Type
Best SMS to Type Time Limit: 1000ms Memory Limit: 65536KB This problem will be judged on PKU. Original ID: 2895 64-bit integer IO format: %lld Java class name: Main Prev Submit原创 2012-09-01 08:56:00 · 986 阅读 · 0 评论 -
BNU OJ The More The Better || HDU 4379
The More The Better Given an sequence of numbers {X1, X2, ... , Xn}, where Xk = (A * k + B) % mod. Your task is to find the maximum sub sequence {Y1, Y2, ... , Ym} where every pair of (Yi, Yj) sa原创 2012-08-18 09:29:45 · 617 阅读 · 0 评论