-
static2d
有限元二维静力计算程序,采用四节点线性单元,可以显示变形和应力云图。(Finite element analysis program for 2D problems)
- 2013-05-18 12:20:48下载
- 积分:1
-
MalmquistLuenberger
基于R程序的malmquist-luenberger 指数的计算源代码。(Malmquist- luenberger index calculation based on R program source code.)
- 2020-08-23 14:07:46下载
- 积分:1
-
S参数提取
FDTD中利用监视器电场提取S11,S21,S12,S22参数(In FDTD, S11, S21, S12, S22 parameters are extracted from the monitor electric field.)
- 2020-12-12 11:19:17下载
- 积分:1
-
fdk-f
基于FDK的锥束CT全三维重建算法,Matlab语言版本。(FDK cone-beam CT based full three-dimensional reconstruction algorithm, Matlab language version.)
- 2011-10-13 12:54:43下载
- 积分:1
-
umat+hill
计算正交各向异性材料(如木材,复合材料等)的弹塑性本构(The elastoplastic constitutive relation of orthotropic materials is calculated)
- 2020-12-25 22:19:05下载
- 积分:1
-
matlabalgorit
进行干扰源以及声源定位的时延估计技术,以及定位迭代算法相关介绍(Sources of interference and delay estimation techniques for sound source localization, as well as positioning iterative algorithm)
- 2012-10-08 20:50:51下载
- 积分:1
-
11087 统计逆序对
说明: Description
设a[0…n-1]是一个包含n个数的数组,若在ia[j],则称(i, j)为a数组的一个逆序对(inversion)。
比如 有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, 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
-
minimal-path-sets
可靠性-最小路集-编程
计算图的最小路集,是装备可靠性课程的一个作业。(Reliability- minimal path sets- programming calculation of minimal path sets, equipment reliability courses a job.)
- 2013-03-12 19:02:53下载
- 积分:1
-
fulltext
A FORTRAN IV function to compute the
probability of a standard normal deviate
- 2012-09-30 22:03:39下载
- 积分:1
-
Mesh2dv23
MATLAB编写的非结构化网格生成程序,不算很长(MATLAB program written in unstructured mesh generation, not very long)
- 2011-10-09 22:22:08下载
- 积分:1