poj 3468 线段树成段更新
摘要:
A Simple Problem with IntegersTime Limit:5000MSMemory Limit:131072KTotal Submissions:54012Accepted:16223Case Time Limit:2000MSDescriptionYou haveNintegers,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 given interv 阅读全文
posted @ 2014-03-09 17:25 雄.. 阅读(259) 评论(0) 推荐(0)
浙公网安备 33010602011771号