-
PQ decomposition method
进行PQ分解，计算电力系统潮流的有效方法，应用广泛(PQ decomposition is an effective method for calculating power flow in power system.)
- 2019-04-23 21:34:16下载
- 积分：1
-
myproject_Haswall5
穿墙雷达人体呼吸检测，是生命体探测的热门研究方向，本程序用matlab仿真，模拟频率步进雷达的探测方法，通过MTI滤波滤除墙体回波，通过FFT相干积累获取人体呼吸频率(Through-wall radar to detect human breath, is a living body to detect a hot research direction, the procedures used matlab simulation, simulation stepped frequency radar detection method, MTI filter to filter out the echo wall, get through FFT coherent accumulation of the human respiratory frequency)
- 2020-11-19 10:29:38下载
- 积分：1
-
Matrix-Method-game-theory
利用矩阵法求解对策论中的二元零和博弈最优策略(Game theory using matrix method for solving binary zero-sum game in the optimal strategy)
- 2013-06-16 11:10:04下载
- 积分：1
-
Euler_solver
基于有限体积法的naca0012翼型的无粘绕流计算(Calculation of airfoils based on the finite volume method naca0012 inviscid flow around)
- 2012-06-26 18:34:18下载
- 积分：1
-
EX2
利用有限元理论，求一二维梁的固有频率和振型。短边固定，给定长度、横截面积，弹性模量及材料密度已知。并对比理论计算结果进行分析。各参数自己设定。(Using finite element theory, seeking a two-dimensional beam natural frequencies and modes. The short side is fixed, given the length, cross-sectional area, modulus of elasticity and density of the material is known. And compare the theoretical calculation results were analyzed. Each parameter set.)
- 2012-11-19 18:55:57下载
- 积分：1
-
Bayesian-Estimates-
用R做贝叶斯估计，估计随机微分方程中的参数(Bayesian estimation made by R, the parameter estimates stochastic differential equation)
- 2013-11-13 09:57:55下载
- 积分：1
-
CGandlu
CG共轭梯度法迭代解矩阵方程，Hhestens和Stiefel给出，(Conjugate gradient method CG iterative matrix equation solution, Hhestens and Stiefel given)
- 2009-04-11 11:25:14下载
- 积分：1
-
ElectriFieldLine
用matlab对偶极子电场线描绘，能够和等势线一起画出。改变电荷量就能得到不同的电场线分布。(Electric field line of a diple)
- 2011-11-14 16:35:17下载
- 积分：1
-
25_GONG
列句25宫的所有组合。
每行,每列,和对角线 数字和为25。(sentence of 25 out of all the combinations Palace. Each line, each and diagonal figures and 25.)
- 2006-10-10 14:52:44下载
- 积分：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
