-
wwws
比Windows自带的高级一点的计算器,能将整个表达式输入,然后求值。
这个程序要求读者具备编译原理的一些知识。
(Advanced calculator than Windows built, the whole expression input can be then evaluated. This program requires the reader to have some knowledge of compiler theory.)
- 2012-11-01 16:33:56下载
- 积分:1
-
Wake-model
自己总结的一些现阶段用得比较多的尾流计算模型(Some of your summary of present with more drafting calculation model)
- 2021-03-05 16:19:31下载
- 积分:1
-
GEAR
吉尔算法积分一阶微分方程组初值问题的C语言描述,包括主函数、计算微分方程组中各方程右端函数值的函数程序、计算雅克比矩阵的函数程序、矩阵求逆程序等。(GEAR algorithm integral first order differential equations initial value problem of the C language description, including the main function to calculate the differential equations in the equation right function value function procedures, functions Jacobian matrix calculation procedures, matrix inversion procedures.)
- 2021-03-08 11:29:28下载
- 积分:1
-
FDTD
是以有限差分算法的MATLAB实现,可以运行的,给出谐振腔的场强的表示方法(finite diffenence time domain programmed by matlab language is for cavity, and its elelctro magnetic field can be showed.)
- 2009-04-28 08:17:33下载
- 积分:1
-
迭代法估计Beta分布参数
求概率分布函数的参数方法 采用迭代法估计Beta分布的分布参数,(Estimation of distribution parameters of Beta distribution by iterative method)
- 2018-04-19 09:01:14下载
- 积分:1
-
cohesive element模拟复合材料损伤-VUMAT
ABAQUS扩展子程序开发,用于计算模拟(ABAQUS extended subroutine application)
- 2021-03-15 20:19:22下载
- 积分: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
-
mat_disperse
这是一个matlab程序,包括了面波频散计算,及最小二乘反演的导数计算内容。(This is a matlab procedures, including a surface wave dispersion calculation, and calculation of the derivative of least squares inversion content.)
- 2020-11-18 14:39:39下载
- 积分:1
-
MOM-RCS
矩量法实例 计算细导线的雷达散射截面,PPT资料(Instance of the method of moments to calculate the radar cross section of thin wire)
- 2021-04-04 21:29:04下载
- 积分:1
-
贝叶斯聚焦算法IEEE Bayesian-Focusing
最新的关于贝叶斯聚焦算法IEEE文章。该算法通过利用信号DOA概率密度函数实现加权的阵列波前差值法,能实现宽带相干信号的DOA估计,并能减小阵列聚焦误差,提高宽带阵列频域波束形成鲁棒性。(In this paper, we present and study a Bayesian focusing transformation (BFT) for coherent wideband array processing, which takes into account the uncertainty of the direction
of arrivals (DOAs). The Bayesian focusing method minimizes the
mean-square error of the transformation over the probability densityfunctions(pdfs)oftheDOAs,thusachievingimprovedfocusing
accuracy over the entire bandwidth)
- 2021-04-07 23:19:01下载
- 积分:1