恒邪

2014年4月17日 #

[ACM] poj 3468 A Simple Problem with Integers（线段树，成段更新，懒惰标记）

摘要： A Simple Problem with IntegersTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 55273Accepted: 16628Case Time Limit: 2000MSDescriptionYou 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 each number in a giv 阅读全文

posted @ 2014-04-17 21:39 恒邪 阅读(108) 评论(0) 推荐(0) 编辑

[ACM] hdu 2795 Billboard （线段树）

摘要： BillboardTime Limit: 20000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8962Accepted Submission(s): 3997Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the 阅读全文

posted @ 2014-04-17 20:40 恒邪 阅读(155) 评论(0) 推荐(0) 编辑

[ACM] hdu 1698 Just a Hook （线段树，成段更新，懒惰标记）

摘要： Just a HookTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14942Accepted Submission(s): 7409Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecu 阅读全文

posted @ 2014-04-17 12:59 恒邪 阅读(152) 评论(0) 推荐(0) 编辑

ACM hdu 1028 Ignatius and the Princess III

摘要： Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11692Accepted Submiss... 阅读全文

posted @ 2014-04-17 11:19 恒邪 阅读(146) 评论(0) 推荐(0) 编辑

导航