-
20060401
说明: 二阶曲线拟合,最小二乘法,此程序是在c++ builder6.0环境下开发的(second curve fitting, least squares method, this procedure is in c builder6.0 development of the environment)
- 2006-04-01 14:48:43下载
- 积分:1
-
reynoldre
湍流模型re计算流体力学软件udf 可以用于修改UDF文件(turbulence model FLUENT)
- 2021-01-02 15:18:57下载
- 积分:1
-
jifen
常用的积分函数,能够很方便的解决数值积分的问题(Commonly used integral function, can be very convenient to solve the problem of numerical integration)
- 2007-09-19 13:51:49下载
- 积分:1
-
FDTD_2D_RCS
这是一个用FDTD算法计算二维导体方柱散射场RCS的matlab程序.采用UPML吸收边界条件和高斯脉冲源激励,对于学习FDTD方法中的激励源加入,近-远场外推,吸收边界设置等很有帮助(This is a FDTD algorithm using two-dimensional square cylinder conductor scattering RCS of the matlab program. UPML absorbing boundary conditions used and the Gaussian pulse source excitation, the FDTD method to study the excitation source join, near- far outside the push, absorbing boundary settings, such as helpful)
- 2021-04-08 23:29:00下载
- 积分:1
-
NB
说明: 朴素贝叶斯算法,以函数形式实现,花了一个上午的时间(Naive Bayes algorithm, in order to function the form of implementation, a morning flower time)
- 2009-03-23 23:02:56下载
- 积分:1
-
bp
说明: c++编程bp神经网络,用c++语言编写的bp神经网络(C++ programming bp neural network, bp neural network written in c++ language.)
- 2018-04-28 15:09:52下载
- 积分: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
-
3nodes
基于牛拉法的电力系统潮流计算,该程序是计算IEEE3节点的,采用matlab编程(Cattle Rafah-based power system load flow calculation, the program the calculation IEEE3 node, using matlab programming)
- 2020-12-17 21:29:12下载
- 积分:1
-
pls_core
PLS计算
Cross-Validation模型计算(PLS calculated Cross-Validation model)
- 2006-06-03 11:37:36下载
- 积分:1
-
shuiku-tiao-hong-
小型水库的调洪,最大下泄流量的计算,采用试算法计算(Flood of small reservoirs, the largest discharged flow calculation, using the test algorithm)
- 2011-09-15 10:00:05下载
- 积分:1