-
3DForce
Fortran编写的用来计算集中力在三维半空间弹性体中下表面应力的程序。(Written in Fortran is used to calculate the stress concentration at the surface in three-dimensional space of half an elastomer program.)
- 2016-10-10 09:35:53下载
- 积分:1
-
zernfun
波面的zernike多项式拟合,在光学测试领域应用相当广泛(Wave surface zernike polynomial fitting, in the field of application of a wide range of optical test)
- 2009-10-14 15:05:12下载
- 积分:1
-
laser18
光纤激光器速率方程 修改数值后可直接计算(The fiber lasers rate equation)
- 2013-05-14 15:46:23下载
- 积分:1
-
LMMSE
lmmse算法的仿真实现,在相关矩阵的求解上比较有技巧性(lmmse Simulation Algorithm)
- 2011-12-02 00:30:42下载
- 积分:1
-
MCZTFFT
说明: CZT和FFT的C语言实现代码,能有效滤除谐波,噪声。获得信号的频率,是一种良好的频率测量算法。(CZT and FFT of the C language code, can effectively filter out harmonics and noise. Access to the signal frequency, is a good algorithm for frequency measurement.)
- 2020-11-19 19:29:38下载
- 积分:1
-
Integrald1.gz
建筑结构单自由度结构在地震作用下的位移响应杜哈梅积分求解(The SDOF structure of building structures under earthquake displacement response Du Hamei Integral Solution)
- 2012-12-12 14:21:30下载
- 积分:1
-
11087 统计逆序对
Description
设a[0…n-1]是一个包含n个数的数组,若在i<j的情况下,有a[i]>a[j],则称(i, j)为a数组的一个逆序对(inversion)。
比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。
一个n个元素序列的逆序对个数由三部分构成:
(1)它的左半部分逆序对的个数,(2)加上右半部分逆序对的个数,(3)再加上左半部分元素大于右半部分元素的数量。
其中前两部分(1)和(2)由递归来实现。要保证算法最后效率O(nlogn),第三部分(3)应该如何实现?
此题请勿采用O(n^2)的简单枚举算法来实现。
并思考如下问题:
(1)怎样的数组含有最多的逆序对?最多的又是多少个呢?
(2)插入排序的运行时间和数组中逆序对的个数有关系吗?什么关系?
输入格式
第一行:n,表示接下来要输入n个元素,n不超过10000。
第二行:n个元素序列。
输出格式
逆序对的个数。
输入样例
5
2 3 8 6 1
输出样例
5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array.
For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency.
The number of inverse pairs of a sequence of n elements consists of three parts:
(1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half.
The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented?
Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)
- 2019-01-07 23:52:06下载
- 积分:1
-
Sllcorrelation
分析两时间序列之间的超前和之后关系,计算滞时长度,多用于水文气象方面分析研究(Analysis ahead of and after the relationship between the two time series, calculating the lag length, used for the analysis of hydrometeorological)
- 2020-07-10 10:08:55下载
- 积分:1
-
Euler_2D
二维Euler方程的Jameson求解方法(Jameson solution of two-dimensional Euler equations)
- 2020-09-09 21:18:03下载
- 积分:1
-
UMAT_Damage
对于abaqus子程序学习的初学者,这是一个学习umat的很好算例,(Abaqus subroutine for beginners to learn, this is a good example to learn umat,)
- 2013-05-24 15:01:35下载
- 积分:1