-
mms
一个基于串口的手机短信发送/接收程序；Demo很简单，是以异步方式读写串口的；在对话框初始化中修改串口的配置参数正确后，能100 的正常发送/接收短信(Based on the serial port of a cell phone message to send/receive process Demo is very simple, based on asynchronous serial reading and writing at initialization dialog box to modify the configuration of serial port parameters correctly, the can 100 of the normal Send/receive message)
- 2009-03-13 14:09:32下载
- 积分：1
-
music.C
音乐程序的频谱码表及应用程序详细描述了程序的功能解释
(music)
- 2009-07-01 11:42:54下载
- 积分：1
-
matlab-LDPC
ldpc的matlab实现程序，和几篇文档资料(ldpc matlab implementation procedures, and several documentation)
- 2013-03-04 11:03:46下载
- 积分：1
-
GoldPrinterV2.5源码
说明： C#打印控件源码,针对打印控件的处理情况 ，能够实现相关的控件打印(C# Print Control Source, for the processing of print control, can achieve related control printing)
- 2020-06-22 07:40:02下载
- 积分：1
-
communication
一份红外通讯的编码设计,已经经过实验，支持一对多。(Encoding of an infrared communication design, and after the experiment, to support one to many.)
- 2012-04-11 11:42:38下载
- 积分：1
-
WiFi-AP-Solo_VA_0917
使用微软API实现SoftAP功能，ICS功能。 (Microsoft API to achieve SoftAP function, ICS functionality.)
- 2013-06-13 16:58:25下载
- 积分：1
-
播放mp3的控件
This module implements the interface and output system for Windows Media Audio. If you use this module with your application, you will need to deploy wmaudioredist.exe (the CORE) with your program. The SDK (and the CORE) are claimed by Microsoft to be BETA. It seems to work correctly, but beware of BETA! Please, notify me, when Microsoft releases the final version of the SDK. Redistribution terms for this module consist of two parts. 1) wmamp.esp redistribution terms are defined by EldoS Sounds license. 2) The CORE redistribution terms are defined by Microsoft. As for now its redistribution is free.
- 2005-01-30 13:05:35下载
- 积分：1
-
player
用c#编写的音乐播放器。可播放mp3、wma等格式，带显示lrc歌词模式。(With c# written in music player. Can play mp3, wma and other formats, with lyrics display lrc mode.)
- 2010-01-31 19:32:35下载
- 积分：1
-
student_management
一个学生信息管理的小系统，可以增加记录，查找记录，可以将数据导出到制定文件(student information management)
- 2013-12-16 21:49:36下载
- 积分：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
