-
kalmanfileter_c-code
外国人写的卡尔曼滤波器算法的库,可以供大家参考,已经封装好了(kalman library)
- 2012-04-24 10:46:44下载
- 积分: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
-
Map-projection
1、根据所给的中国版图数据
绘制显示基于北京54坐标系的经纬度数据
编写兰勃特投影转换程序,转换上述数据,并显示
编写墨卡托投影转换程序,转换上述数据,并显示
同时,要绘制相对应的经纬网格,网格间距5度
2、根据所给的世界版图数据
绘制显示基于WGS84坐标系的经纬度数据
编写墨卡托投影转换程序,转换上述数据,并显示
计算北京(116.4,39.8)到巴黎(2.2, 48.52)的大圆轨迹,并显示
同时,要绘制相对应的经纬网格,网格间距5度(1, according to the Chinese territory given display data drawn based on latitude and longitude data write Beijing 54 coordinate system Lambert projection conversion process, the conversion of the data, and displays the write Mercator projection conversion process, the conversion of the data, and display the same time, Draw the corresponding latitude and longitude grid, the grid spacing of 5 degrees 2, according to the world map rendering display data written to the Mercator projection based on latitude and longitude data conversion program WGS84 coordinate system, the conversion of the data, and displays the calculation Beijing (116.4, 39.8) to Paris (2.2, 48.52) the great circle track and display the same time, to draw the corresponding latitude and longitude grid, the grid spacing of 5 degrees)
- 2015-12-08 21:51:30下载
- 积分:1
-
UDFlizi
基于FLUENT软件的一些常用UDF实例,比较有帮助(udf example)
- 2015-10-20 15:56:14下载
- 积分:1
-
FEMC
这里包含了有限元法的一本书籍,和有限元法的C++代码。希望对各位有所帮助(This contains a finite element method books, and the finite element method of C++ code. I hope to help you)
- 2016-06-02 09:20:34下载
- 积分:1
-
power-method
用幂法反幂法求解方阵的最大最小特征值及其特征向量,C语言程序,基本的数值计算算法(power method and inverse power method)
- 2011-11-24 20:09:25下载
- 积分:1
-
PRproject_lda
说明: 线性判别分析(LDA,全称Fisher Linear Discriminant Analysis)算法的C#实现源码,根据stprtool box for matlab中的LDA.m编写。用到MathNet库做相关的矩阵运算,使用zedgraph控制绘图。有简单的测试数据。( C# source code of linear discriminant analysis (LDA, full name of the Fisher Linear Discriminant Analysis) algorithm , according to LDA.m of stprtool box for matlab . Use MathNet library to do matrix operations,and use zedgraph control for drawing. Thers has a simple test data.)
- 2010-04-20 09:59:35下载
- 积分:1
-
FDTD_microstrip
分享一个外国人编写的FDTD程序,可以用来计算微带线和微带贴片天线,程序中采用的是均匀网格划分,但也可以在容易地在它基础上改写成非均匀网格.其边界条件与Sheen的程序不同,这里采用二阶技术.(Prepared to share a foreigner FDTD procedures, can be used to calculate the microstrip lines and microstrip patch antenna, the procedure used is uniform mesh, but can also easily rewrite it into the basis of non-uniform grid. its boundary conditions with different processes and Sheen, where second-order technology.)
- 2020-12-07 16:39:22下载
- 积分:1
-
Kalman
卡尔曼滤波的C语言实现,可用于估测电池soc等(C language implementation of Calman filter)
- 2018-05-09 13:51:39下载
- 积分:1
-
WashTransformation
计算给定序列的沃什(Walsh)变换序列。(Calculation of a given sequence of Vas (Walsh) transform sequence.)
- 2008-05-19 15:38:24下载
- 积分:1