2016年1月12日
A Simple Problem with Integers(线段树，区间更新)
摘要： Description You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to 阅读全文
posted @ 2016-01-12 21:22 handsomecui 阅读(1489) 评论(0) 推荐(0) 编辑
Billboard(线段树)
摘要： BillboardTime Limit: 20000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16755Accepted Submission(s): 7089 Probl... 阅读全文
posted @ 2016-01-12 20:20 handsomecui 阅读(442) 评论(0) 推荐(0) 编辑
Joseph（约瑟夫环）
摘要： JosephTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2094Accepted Submission(s): 1273Problem Desc... 阅读全文
posted @ 2016-01-12 18:03 handsomecui 阅读(306) 评论(0) 推荐(0) 编辑