线段树
Zhangcan233
这个作者很懒,什么都没留下…
展开
-
poj2299 B - Ultra-QuickSort(线段树与树状数组求逆序对数)
题目: In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence原创 2017-08-13 23:16:07 · 545 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers(区间查询区间更新)
题目: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 each number in a given interval. The other is to ask for the原创 2017-08-15 12:47:47 · 228 阅读 · 0 评论 -
hdu3577 Fast Arrangement
题目:Chinese always have the railway tickets problem because of its’ huge amount of passangers and stations. Now goverment need you to develop a new tickets query system. One train can just take k pass原创 2017-08-15 16:01:33 · 553 阅读 · 0 评论 -
#6029. 「雅礼集训 2017 Day1」市场--线段树区间更新
题目链接:市场 题目: 1948: #6029. 「雅礼集训 2017 Day1」市场 Time Limit: 2 Sec Memory Limit: 256 MB Submit: 43 Solved: 8 [Submit][Status][Web Board] Description 从前有一个贸易市场,在一位执政官到来之前都是非常繁荣的,自从他来了之后原创 2017-07-12 10:40:00 · 1473 阅读 · 0 评论