分治和归并
文章平均质量分 63
陶鸿杰
这个作者很懒,什么都没留下…
展开
-
快速排序
明天要面试,听说会考快速排序,预习一下/*选在一个基准数,比它小的在它的左边,比它大的在它的右边。(分治)然后再对左右两部分进行上面的操作一直到最后时间复杂度O(n^2)到O(nlogn)不是稳定的排序方式*/#include<bits/stdc++.h>using namespace std;void QuickSOrt(int a[], int start, int last){ if(start>=last) return ; i原创 2020-07-05 23:53:51 · 342 阅读 · 2 评论 -
逆序数(51Nod1019)(归并排序)
1019 逆序数基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注在一个排列中,如果一对数的前后位置与大小顺序相反,即前面的数大于后面的数,那么它们就称为一个逆序。一个排列中逆序的总数就称为这个排列的逆序数。如2 4 3 1中,2 1,4 3,4 1,3 1是逆序,逆序数是4。给出一个整数序列,求该序列的逆序数。Input第...原创 2018-05-16 20:49:13 · 262 阅读 · 0 评论 -
Equivalent Strings————分治与归并
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:They are equal. If we split...原创 2018-08-03 20:53:32 · 434 阅读 · 2 评论 -
Raid————分治与归并
After successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire repelled the six waves of Union’s attack. ...原创 2018-08-03 20:57:34 · 391 阅读 · 0 评论 -
Quoit Design ————分治与归并(平面分治模板)
Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded. In the field of Cyberground, the position of each toy i...原创 2018-08-03 21:03:28 · 570 阅读 · 0 评论 -
Ultra-QuickSort ————分治
n 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...原创 2018-08-03 21:05:02 · 228 阅读 · 0 评论