Location:
Search - series array
Search list
Description: Dolph-Tschebyscheff Array的一段程序，日本人编的，希望对大家有帮助-Dolph- Tschebyscheff Array section of the procedure, Japanese series, we hope to help
Platform: |
Size: 50176 |
Author: cathy |
Hits:
Description: 用java实现的一系列关于树组的基础代码。-Using java to achieve a series of groups on the basis of the code tree.
Platform: |
Size: 9216 |
Author: 华天晴 |
Hits:
Description: 楼天城大牛的冬令营论文.
浅谈部分搜索+高效算法在搜索问题中的应用
浙江省杭州第十四中学 楼天城
摘要：
本文从有位置限制的匹配问题的搜索谈起，通过对题目Milk Bottle Data的分析，提出了深度优先搜索的一种非常规搜索——部分搜索+高效算法。然后通过部分搜索在Triangle Construction和智破连环阵两题中的应用，探讨了部分搜索方法通用的主要优化方法，并从此方法本质分析其高效的原因所在和应用需要满足的要求和限制。
-Floor-day winter cattle City papers. On the part of the search+ Efficient algorithm in search problems in the application of secondary schools in Zhejiang Province Hangzhou, 14th Floor, Tin Shing Abstract: This article from the location restrictions about matching search through the topics Milk Bottle Data analysis, put forward a depth-first search of an unconventional search- part of the search+ efficient algorithms. And then through part of the search in the Triangle Construction and Moses broke the two questions in a series array of applications, explore some of the major generic search method optimization method, and from this method of analysis of the nature of its efficient cause of the problem and applications need to meet the requirements and limitations.
Platform: |
Size: 76800 |
Author: Nick |
Hits:
Description: C++的数组类管理类定义
被本人持续使用并完善超过20年
支持动态数组，和2维数组
类似于VC++中的CArray,且许多内部方法都与CArray的内部方法相同，但效率和方便性比CArray要好许多。特别重要的是：它们可以跨平台地工作于任何C++开发环境。-A c++ array management type definition series. They work like CArray class in VC++.But they work more efficient and more convenient than CArray .Most importantly,they work cross-platform,they can work under any C++ development platform.
Platform: |
Size: 5120 |
Author: zeng rongjia |
Hits:
Description: 这是一系列的java关于数组的程序，能够让你高速方便的掌握数值。-This is a series of java array about the procedure so that you can master the high-speed numerical convenience.
Platform: |
Size: 9216 |
Author: andy |
Hits:
Description: 有序整数顺序存储数列的合并与数据删除
本次实验要求学生设计、实现、测试一个C/C++程序，基本步骤为：
1 分别从两个文件中读取已排序好的正整数到两个数组中；
2 合并这两个数组到第三个有序数组中并在屏幕终端输出第三个数组的数据。两个数据相同时只选择其中之一输出；
3 报告输出数据中不同数据的个数；
4 从数组中连续删除部分数据再输出结果；
5 把第一步改成用键盘输入数据测试你的输出结果；
6 详细注释你的程序。
-Integer stored in an orderly sequence of series of mergers and the deletion of the experimental data requires students to design, implementation, testing a C/C++ program, the basic steps are as follows: 1, respectively, read from the two documents have been sorted into two good positive integer array China 2 to merge these two arrays into a third in an orderly array and on the screen output of the third terminal of the data array. At the same time, two data output to select only one of them 3 report output data of the number of different data 4 to delete a row from the array and then output the results of part of the data 5 the first step into the keyboard input data used to test the output you 6 detailed notes of your procedures.
Platform: |
Size: 2048 |
Author: airxice |
Hits:
Description: Basic wavelet routines for time series (1D), image (2D) and array (3D) analysis. The
code provided here is based on wavelet methodology developed in Percival and Walden (2000)
Gencay, Selcuk and Whitcher (2001) the dual-tree complex wavelet transform (CWT) from
Kingsbury (1999, 2001) as implemented by Selesnick and Hilbert wavelet pairs (Selesnick
2001, 2002). All figures in chapters 4-7 of GSW (2001) are reproducible using this package and
R code available at the book website(s) below.-Basic wavelet routines for time series (1D), image (2D) and array (3D) analysis. The
code provided here is based on wavelet methodology developed in Percival and Walden (2000)
Gencay, Selcuk and Whitcher (2001) the dual-tree complex wavelet transform (CWT) from
Kingsbury (1999, 2001) as implemented by Selesnick and Hilbert wavelet pairs (Selesnick
2001, 2002). All figures in chapters 4-7 of GSW (2001) are reproducible using this package and
R code available at the book website(s) below.
Platform: |
Size: 1160192 |
Author: Christian Hagglof |
Hits:
Description: 51单片机控制led点阵显示实例，包含keil c程序及proteus电路图。用74HC595实现串行显示。-An demo of 51 series SCM control led array to display. The file include C51 program by Keil C and circuit schematic by Proteus. Applying 74HC595 to display in serie port.
Platform: |
Size: 62464 |
Author: haoshuzhuang |
Hits:
Description: 由于自带了很多的函数，IDL 在数组或矩阵的创建、运算操作中有着一系列
的技巧。要写出一个高效的IDL 程序，必须知道怎么用数组来进行数据处理，
对数组的创建和运算等进行了总结-Comes with a lot of functions because, IDL array or matrix in the creation, operation operation has a series of skills. IDL to write an efficient program, you must know how to use an array for data processing, the creation and operation of such arrays are summarized
Platform: |
Size: 190464 |
Author: 孙彬 |
Hits:
Description: Conformal Array Antenna Theory and Design by Josefsson, Persson this BOOKS IN THE IEEE PRESS SERIES ON ELECTROMAGNETIC WAVE THEORY
Platform: |
Size: 8863744 |
Author: mustaf dhia |
Hits:
Description: 数组倒置，数列相乘，数组的输入输出
求数组中最大的数-Array of inverted series array of input and output requirements by multiplying the largest number of array
Platform: |
Size: 1024 |
Author: 东方寒永 |
Hits:
Description: 基于LabVIEW平台的关于数组的一系列实例，很不错的例子-LabVIEW-based array platform on a series of examples, very good example
Platform: |
Size: 172032 |
Author: 江山 |
Hits:
Description: //金币阵列问题
/*算法思想：将原始数列作为参考数列（m*n)，将目标数列的第一列与本身的-n列分别进行对调
在每次对调后进行一下处理：比较对调后的第一列与原始数列的第一列，从而知道对应的行是否要
进行变换。行变换确定后，然后确定列变换，通过列遍历性的交换，将目标数列转换到原始数列*/
-//Gold array problem
/* Algorithm thinking: the original series as the reference sequence (m* n), the first column of the target sequence itself-n columns swapped
After each swap: relatively reversed after the first column the first column of the original series, so you know the row corresponding to whether or not to
Be transformed. Line transformation is determined, then determine the column transform exchange column ergodicity, the number of targets are converted to the original number of columns* /
Platform: |
Size: 8192 |
Author: 任子羽 |
Hits:
Description: arr[]为数据数列，即这个串.如果有n个数，存为arr[0]~arr[n-1],并且保证每个数大于0,小于ASCII。
调用参数前，设置：arr[n]=0,n++
这样得出的sa[]数列:sa[0]肯定等于n,即排名为0的是第n个打头的后缀串,这个是我们加上去的，是无用的。
sa[1]才表示真正的串中排名为1（即第一）的串在arr[]中的起始位置
rank[i]=j数列：以第i个打头的串排名为j,可知，rank[n]=0。
height[i]=j表示排名为i的串和它前面一个串(即i-1)的公共前缀。可知height[]的有效范围为2~n
height[1]是排名为0的和排名为1的公共前缀，而排名为0的是我们加上去的arr[n]=0,所有必定为0且没有意义-arr [] is the number of data columns, and that the string. if there are n number of save arr [0] to arr [n-1], and to ensure that each number is greater than 0 and less than an ASCII. Before the call parameters set: arr [n] = 0, n++ This gives sa [] series: sa [0] is certainly equal to n, that is ranked 0 starts with the n-suffix string, this is our plus up, is useless. sa [1] before the real string# 1 (first) string starting position rank in arr [] [i] = j series: i-starts with the string rank j, we can see rank [n] = 0. height [i] = j indicates the ranking is a string of i, and in front of it a string (i.e., i-1) of the common prefix. Seen height [] the effective range of 2 ~ n height [1] is a ranking of 0 and ranked as one of the common prefix ranked 0 we add to the arr [n] = 0, all must be 0 and does not make sense
Platform: |
Size: 1024 |
Author: 陶翔 |
Hits:
Description: 数组的一系列运算符重载，使用-Series array operator overloading, use ........
Platform: |
Size: 1389568 |
Author: sps |
Hits:
Description: 本书以最新流行的不需要外部晶振与复位电路的可仿真的高速 STC15 系列单片机为核心，详细介绍了
单片机内部功能模块，比如定时器、中断、串口、SPI 接口、片内比较器、ADC 转换器、可编程计数器阵列
(CCP/PCA/PWM)等。每个重要知识点都有简短精炼的实例作验证，然后就是单片机常用外围接口的介绍与
STC15 系列单片机的实际产品运用实例分析。另外对单片机开发必须掌握的 C 语言基础知识与 Keil 开发环
境也作了较为详细的介绍，对于没有学习过 C 语言的读者通过本书也能轻松进入以 C 语言开发单片机的学
习状态。-英语 简体中文 繁体中文
Book with the latest does not require an external crystal oscillator and reset circuit simulation of high-speed STC15 series SCM as the core, introduced
Monolithic integrated circuit internal functional modules, such as timers, interrupts, serial port chip comparators, ADC, SPI interface, converters, programmable counter array
(CCP/PCA/PWM) and so on. Each important point is a short refining instance validation, and introduction of common peripheral interface is a single-chip microcomputer
STC15 series monolithic integrated circuit the actual product use case analysis. Additionally to the monolithic integrated circuit development must grasp the basic knowledge of c language with the Keil development central
Borders also made a more detailed introduction, for readers without learning c language this book can easily enter in c language development of single-chip microcomputer
Learning State.
Platform: |
Size: 2412544 |
Author: waerdeng |
Hits:
Description: This Work present a Matlab/SIMULINK model of a photovoltaic cell, Panel and Array. This model is based on mathematical equations and is described through an equivalent circuit including a photocurrent source, a diode, a series resistor and a shunt resistor. The developed model allows the prediction of PV cell behaviour under different physical and environmental.
Platform: |
Size: 101376 |
Author: saad |
Hits:
Description: sidebar',
'before_widget' => '<div id="%1$s" class="widget %2$s">',
'after_widget' => '</div>',
'before_title' => '<h4 class="widget-title">',
'after_title' => '</h4>',
));
if ($mts_options['mts_footer_widget'] != '0') {
register_sidebar(array(
'name' => 'Footer Widget 1',
'description' => __( 'Appear
Platform: |
Size: 342016 |
Author: rafabatist
|
Hits:
Description: function array is always used in series of functions
Platform: |
Size: 5120 |
Author: APPLE0121
|
Hits:
Description: 小易有一个长度为N的正整数数列A = {A[1], A[2], A[3]..., A[N]}。
牛博士给小易出了一个难题:
对数列A进行重新排列,使数列A满足所有的A[i] * A[i + 1](1 ≤ i ≤ N - 1)都是4的倍数。
小易现在需要判断一个数列是否可以重排之后满足牛博士的要求。
输入描述:
输入的第一行为数列的个数t(1 ≤ t ≤ 10),
接下来每两行描述一个数列A,第一行为数列长度n(1 ≤ n ≤ 10^5)
第二行为n个正整数A[i](1 ≤ A[i] ≤ 10^9)
输出描述:
对于每个数列输出一行表示是否可以满足牛博士要求,如果可以输出Yes,否则输出No。
输入例子1:
2
3
1 10 100
4
1 2 3 4
输出例子1:
Yes
No
*/(It has a length of N integers A = {A[1], A[2], A[3], A[N]}...
Dr out of a problem for small:
The series A rearrange the sequence of A meet all A[i] * A[i + 1] (I = 1 ~ N - 1) are multiples of 4.
Xiao Yi now need to determine whether a series can meet the requirements after the rearrangement of Dr.
Input description:
The number of the first series of T input (t = 1 ~ 10),
Then every two lines describe a series of A, the first act of sequence length n (1 N 10^5)
Second n positive integer A[i] (1 A[i] 10^9)
Output description:
For each sequence, output a line indicating whether it can meet the requirements of Dr. Niu, and if you can output Yes, otherwise output No.
Input example 1:
Two
Three
110100
Four
1234
Output example 1:
Yes
No
* /)
Platform: |
Size: 688128 |
Author: 堪准节
|
Hits: