-
Matrix
最小二乘法的c语言程序,能求解多元方程组,具有良好的效果(The C language program of the least square method can solve the multiple equations. It has good effect.)
- 2017-12-08 10:39:40下载
- 积分:1
-
高等光学仿真2
comsol仿真的学习教程,有助于初学者深度掌握comsol的 基本使用(Comsol simulation course is helpful for beginners to master the basic usage of COMSOL)
- 2019-03-28 09:48:49下载
- 积分:1
-
fpa
code for methuristic algorithm flower pollination algorithm
- 2017-05-20 00:21:23下载
- 积分:1
-
sma_um
说明: Umat Abaqus for plasticity
- 2020-06-20 02:40:01下载
- 积分:1
-
pc547
各种kalman滤波器的设计,包括广义互相关函数GCC时延估计,实现典型相关分析。( Various kalman filter design, Including the generalized cross-correlation function GCC time delay estimation, Achieve canonical correlation analysis.)
- 2017-05-19 10:17:29下载
- 积分:1
-
doa
DOA估计:最大熵算法、最小模算法、最小方差算法。输入: 快拍数据协方差矩阵R,观察范围内各方向导向矢量,三维矩阵phiyz。输出:最小方差谱估计矩阵P。(DOA Estimation: maximum entropy algorithm, the minimum norm algorithm, the minimum variance algorithm. Input: snapshot of the data covariance matrix R, the steering vector of each direction in the observed range of three-dimensional matrix phiyz. Output: the minimum variance spectral estimation matrix P.)
- 2012-06-18 10:25:01下载
- 积分:1
-
Burgers
用麦克麦考方法求解一维burgers方程的matlab代码(By Mike McCaw method for solving one-dimensional burgers equation matlab code)
- 2021-02-13 14:59:49下载
- 积分:1
-
CFD-SIMULATION-OF-BOILING-FLOWS
计算机流体理论方面的文献,动网格的划分和计算(Literature, of the theory of computational fluid dynamic division and calculation of the grid)
- 2012-06-06 10:07:31下载
- 积分: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
-
vumat1
是ABAQUS有限元模拟软件的子程序,主要研究损伤断裂(a subroutine of ABAQUS for damage and fracture
)
- 2015-01-03 09:27:40下载
- 积分:1