-
C语言 SimpleCAD样例
一个简单的C语言开发的CAD二维画图软件，对刚刚开始学习大型程序设计的学习者有一定帮助(A simple CAD two-dimensional drawing software developed in C language is helpful for learners who are just beginning to learn large-scale programming.)
- 2020-06-23 18:00:02下载
- 积分：1
-
LINQ 实战开发
LLINQ, Language INtegrated Query, is a new extension to the Visual Basic and C# programming languages designed to simplify data queries and database interaction. It addreses O/R mapping issues by making query operations like SQL statements part of the programming language. It also offers built-in support for querying in-memory collections like arrays or lists, XML, DataSets, and relational databases. "LINQ in Action" is a fast-paced, comprehensive tutorial for professional developers. This book explores what can be done with LINQ, shows how it works in an application, and addresses the emerging best practices. It presents the general purpose query facilities offered by LINQ in the upcoming C# 3.0 and VB.NET 9.0 languages. A running example introduces basic LINQ concepts. You"ll then learn to query unstructured data using LINQ to XML and rel
- 2022-08-15 21:28:26下载
- 积分：1
-
RemoteSrceenControl
一个远程监视控制屏幕的程序，包括服务器和客户端 .vs2008下编译通过。
(A remote monitoring control screen procedures, including server and client. Vs2008 compile.)
- 2011-10-19 17:27:48下载
- 积分：1
-
emd
经验模态分解分析噪声信号，带源码，初学者可参考(Empirical mode decomposition analysis of noise signal, with source code, beginners can reference)
- 2012-04-26 13:01:46下载
- 积分：1
-
DRM-OFDM-mudulation
数字音频广播系统中的正交频分复用调制模块代码。(DRM OFDM modulation)
- 2015-11-13 19:22:16下载
- 积分：1
-
围棋板源代码
go board source code
- 2022-06-30 15:52:54下载
- 积分：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
-
pwmkongzhibujindianji
ARM7通过PWM控制步进电机的小程序，试验通过(ARM7 PWM control stepper motor procedures, test by)
- 2012-05-23 00:28:10下载
- 积分：1
-
c68hc11
ucos 在 motloar 单片机上的移植(uCOS motloar Singlechip in the transplant)
- 2007-12-03 11:29:36下载
- 积分：1
-
glew-1.10.0-win32
opengl的扩展库glew,包含源码与连接库，2013年更新，版本至1.10(opengl extensions library glew, including source code and link library, 2013 updated to version 1.10)
- 2020-10-15 20:07:29下载
- 积分：1
