-
FreqzPhase
对信号进傅里叶变换,得到振幅谱和相位谱,并可画出振幅谱和相位谱。(The signal into the Fourier transform, the amplitude spectrum and phase spectrum and amplitude spectrum and phase draw spectrum.)
- 2009-01-04 21:10:40下载
- 积分:1
-
square_f
方柱绕流Lattice boltzman method(rectangular pillar LBM )
- 2011-09-30 00:47:53下载
- 积分:1
-
Average stress
计算多材料单元平均应力应变,用于提取计算等效弹性模量 泊松系数(Calculate the average stress-strain of multi-material elements)
- 2020-11-11 18:59:45下载
- 积分:1
-
Newmark
说明: 工程中微分方程数值积分经常需要使用的Newmark法(Differential equations numerical integration project often requires the use of the Newmark method)
- 2008-09-03 22:02:30下载
- 积分:1
-
11
说明: 用二分法求解一元五次非线性方程的实数解,在高等电路学习中有很好的用途。(One yuan of five nonlinear equations dichotomy solving real solutions, there is a very good use in the higher circuit learning.)
- 2012-10-27 20:52:45下载
- 积分:1
-
Aximn
说明: fortran弹塑性分析程序,很有用的啊!(fortran plastic analysis program, very useful)
- 2021-04-15 19:48:54下载
- 积分:1
-
mijidu
海冰密集度的matlab计算程序和分析!(The sea ice concentration matlab procedures and analysis!)
- 2020-07-03 10:00:02下载
- 积分:1
-
2
说明: 9跨每跨35米桥梁响应的车桥耦合程序,使用Fortran编写(9 of 35 meters span bridge across every bridge coupled response procedures, the use of Fortran written)
- 2011-05-19 23:25:12下载
- 积分: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
-
UMAT
abaqus Umat 计算复合材料的损伤问题,可以学习一下(abaqus umat subroutine for damage of the composite material)
- 2021-01-14 19:48:47下载
- 积分:1