-
clusterinquest
cluster in quest聚类算法是基于密度和网格的聚类算法。对于大型数据库的高维数据聚类集合。(cluster in quest clustering algorithm is based on the density of the grid and clustering algorithm. For large database of high-dimensional data clustering pool.)
- 2006-12-08 21:13:15下载
- 积分:1
-
covFunctions
高斯回归建立代理模型行协方差函数的选着的变成(gpml-matlab-v3.1-2010-09-27)
- 2011-01-03 19:18:15下载
- 积分:1
-
jichafenxi
正交实验中的极差分析代码,确定因素的优水平和最优水平组合,给出指标趋势图。(Orthogonal experiment range analysis code to determine the factors that the optimal level of excellent level and combination of indicators of trends is given.)
- 2008-06-04 19:04:22下载
- 积分:1
-
cp1
计算风力机的转换功率的算例
根据流体力学激盘素理论推出
最大转换功率不可能超过0.47(cofficience of power change from wind energy to eletricity energy.)
- 2010-02-09 03:18:18下载
- 积分:1
-
LU-SGS
利用时域有限差分求解CFD问题,其中差分格式为LUSGS,是求解流体问题的理论基础(Solved using finite-difference time-domain CFD problems, in which the differential form LUSGS
)
- 2011-12-15 22:43:30下载
- 积分:1
-
LSSVM
利用最小二乘支持向量机原理,创建了LSSVM预测模型(The principle of least squares support vector machine, created LSSVM prediction model)
- 2013-04-01 16:55:12下载
- 积分:1
-
GAUSS-JORDAN
gauss jordan method. not my own program but i just want to share it.
- 2012-09-30 09:32:51下载
- 积分:1
-
CalcActivationCode
岩土数值模拟计算的程序,可以用来计算边坡、岩石稳定性。(Numerical simulation of geotechnical calculation program can be used to calculate the slope, rock stability.)
- 2015-08-17 12:25:56下载
- 积分:1
-
ansys-structure
ansys 求解桥梁结构弯矩响线的命令流,非常实用(ansys solving the stream of the bridge structure bending ring line command is very useful)
- 2012-05-30 12:04:18下载
- 积分: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