随笔分类 -  线段树

poj3468
摘要：A Simple Problem with IntegersTime Limit : 10000/5000ms (Java/Other)Memory Limit : 262144/131072K (Java/Other)Total Submission(s) : 7Accepted Submission(s) : 4Problem DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some 阅读全文
posted @ 2013-11-05 15:42 我家小破孩儿 阅读(156) 评论(0) 推荐(0)
hdu1394
摘要：Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8178Accepted Submission(s): 5022Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a give. 阅读全文
posted @ 2013-10-26 16:27 我家小破孩儿 阅读(155) 评论(0) 推荐(0)
hdu1166（线段树之单点更新）
摘要：敌兵布阵Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 11Accepted Submission(s) : 5Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生 阅读全文
posted @ 2013-10-23 18:06 我家小破孩儿 阅读(156) 评论(0) 推荐(0)