权值线段树
文章平均质量分 67
旺 崽
这个作者很懒,什么都没留下…
展开
-
AtCoder Beginner Contest 190 F.Shift and Inversions
AtCoder Beginner Contest 190 F.Shift and Inversions题目链接这题考了很明显的权值线段树,我曾经写过一道非常类似的题目 ZOJ 1484,感兴趣的可以做完这题再去看一下~权值线段树其实比线段树简单,它记录每个数出现的次数,对这道题的数据范围而言,我们记录的就是 [0,3e5][0,3e5][0,3e5] 这个区间每个数出现的次数。那么对某一数 xxx,我们要求的逆序对数就是查询 [x+1,n][x+1,n][x+1,n] 中有多少个数即可,对 x∈ax原创 2021-01-31 17:22:22 · 1699 阅读 · 2 评论 -
HDUOJ 6609 Find the answer
HDUOJ 6609 Find the answer题目链接Problem DescriptionGiven a sequence of n integers called W and an integer m. For each i (1 <= i <= n), you can choose some elements Wk (1 <= k < i), and change them to zero to make ∑ij=1Wj<=m. So what’s the m原创 2020-09-17 20:09:44 · 2466 阅读 · 0 评论 -
洛谷 P1637 三元上升子序列
洛谷 P1637 三元上升子序列题目链接题目描述Erwin 最近对一种叫 thair 的东西巨感兴趣。。。在含有 nnn 个整数的序列 a1,a2,…,ana_1,a_2,\ldots,a_na1,a2,…,an 中,三个数被称作thair当且仅当 i<j<ki<j<ki<j<k 且 ai<aj<aka_i<a_j<a_kai<aj<ak。求一个序列中 thair 的个数。输入格式开始一行一个正整数 nnn,原创 2020-09-16 17:35:03 · 2530 阅读 · 0 评论 -
Codeforces Round #510 (Div. 2) D. Petya and Array
Codeforces Round #510 (Div. 2) D. Petya and Array题目链接Petya has an array a consisting of n integers. He has learned partial sums recently, and now he can calculate the sum of elements on any segment of the array really fast. The segment is a non-empty seq原创 2020-09-16 16:52:14 · 2403 阅读 · 0 评论 -
HDUOJ 4217 Data Structure?
HDUOJ 4217 Data Structure?题目链接Problem DescriptionData structure is one of the basic skills for Computer Science students, which is a particular way of storing and organizing data in a computer so that it can be used efficiently. Today let me introduce a原创 2020-09-16 12:19:04 · 2382 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort
POJ 2299 Ultra-QuickSort题目链接DescriptionIn 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 is sorted in ascending or原创 2020-07-16 10:27:02 · 2428 阅读 · 0 评论 -
ZOJ 1484 Minimum Inversion Number
ZOJ 1484 Minimum Inversion Number题目链接The inversion number of a given number sequence a1, a2, …, an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.For a given sequence of numbers a1, a2, …, an, if we move the first m >= 0 numbers原创 2020-07-11 10:16:43 · 2348 阅读 · 0 评论