一个数的序列bi，当b1 < b2 < ... < bS的时候，我们称这个序列是上升的。对于给定的一个序列(a1, a2, ..., aN)，我们可以得到一些上升的子序列(ai1, ai2, ..., aiK)，这里1<= i1 < i2 < ... < iK <= N。比如，对于序列(1, 7, 3, 5, 9, 4, 8)，有它的一些上升子序列，如(1, 7), (3, 4, 8)等等。这些子序列中最长的长度是4，比如子序列(1, 3, 5, 8)。
input:
There are several test cases. Every test case includes two lines.
The first line contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each,
separated by spaces. 1 <= N <= 1000
When N is 0, it indicates test to end.
Output must contain a single integer for every test case ---- the length of the longest ordered subsequence of the given sequence. (2019-01-07, C/C++, 2261KB, 下载0次)
利用函数和递归做一个数列的加减运算，数列的加减运算有一定的规律，可利用函数与计算出结果
The constant can be calculated by the infinite series: = 4- 4/3+ 4/5- 4/7+ 4/9- 4/11+.... Write a C program that uses a do/while loop to calculate using the series. The program should ask the user how many terms in the series should be used. Thus if the user enters ‘3’, then the program should calculate as being 4- 4/3+ 4/5. (2016-02-18, C/C++, 5KB, 下载1次)
算法用来计算两个时间序列 x 和 y 之间的距离。
Calculates the distance between two time series x and y. If the distance is
larger than the best so far (bsf) it stops computing and returns the approximate
distance. To get exact distance the bsf argument should be omitted. (2014-05-06, C/C++, 2KB, 下载3次)
Euler工程，相邻元素乘积最大。
给了一个20x20的两位数矩阵，其中的红字部分的积为：
26x63x78x14=1788696
那么，任意方向上（上、下、左、右、对角）4个相邻的数的最大乘积是多少？
In the 20x20 grid below, four numbers along a diagonal line have been marked in red.
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 6 (2011-05-23, C/C++, 4KB, 下载2次)
Sorting by Heapsort and Mergesort algorithms.
===================================
Input file：H01dat.txt
----------------------------
包含第一列為n a b
第二列以後為a1 a2 a3 a4 ...... an
n：要排序的輸入資料數。
ai：要排序的資料，以space 或換行隔開，程式要能自行判斷資料輸入到n筆為止。
-------------------------------------Output：使用標準輸出〈即輸出到螢幕〉
-------------------------------------a：若a = 1，使用heapsort；若a = 2，使用mergesort。
b：若b = 1，則顯示排序後的結果〈由小到大〉；
若b = 2 且a = 1，則輸出Heapsort前兩次的過程(包含Heapify 過程)；
若b = 2 且a = 2，Megersort 則輸出前五次sort 的過程。
Sorting by Heapsort and Mergesort algorithms. =================================== Input file: H01dat.txt--------------------------- nab the second column contains the first column after the a1 a2 a3 a4 ...... an n: to the number of input data sorted. ai: to sort the data, separated by space or newline, the program must be able to judge for themselves the information input to the n pen up.------------------------------------- Output: standard output < that is output to the screen> ------------------------------------ a: if a = 1, using the heapsort if a = 2, using mergesort. b: If b = 1, then display the results sorted < steeled> if b = 2 and a = 1, the output Heapsort during the last two (including Heapify process) if a = b = 2 and 2, Megersort sort the output process of the previous five. (2011-01-24, C/C++, 7KB, 下载1次)
一维多项式多组求值，利用系数预处理法对多项式p(x)=an-1x^n-1+an-2x^n-2+...+a1x+a0,进行多组求值。其中n=2^k
Many one-dimensional polynomial evaluation group, using coefficient polynomial preconditioning method p (x) = an-1x ^ n-1+ an-2x ^ n-2+...+ a1x+ a0, for many Group evaluated. One of n = 2 ^ k (2009-04-03, C/C++, 1KB, 下载4次)
//给定整数n，产生所有[2n]上的匹配（matching）
//将其视为一个所有块大小均为2的集合分拆
//以a_i表示其第i个元素所在的集合号
//输出格式为 a1 a2 a3 ...
//满足
//a_{i+1} <= max { a1,a2,...a_i } + 1
//a given integer n, have all [2n] on the matching (matching)// will be considered as an all pieces are two sets of a split// a_i said in its i elements of a collection of lies// output format for a1 a2 a3 ...// meet// a_ i (a) (2007-06-13, C/C++, 1KB, 下载2次)
//=== === === === === === === === === === === =====
//函数说明
//函数名称：Correlation
//函数功能：计算最小二乘法拟合的多项式的相关系数
//使用方法：int M------ 拟合多项式的阶数（已知条件）
// double *b--- 拟合曲线的系数,排列顺序为由高阶到低阶（已知条件）
// double *x--- 结点x轴数据（已知条件）
// double *y--- 结点y轴数据（已知条件）
// double *Yg-- 结点估计值，个数为m（过程变量）
// int m------ 结点个数（已知条件）
//注意事项：多项式阶数最高为10,多项式的形式为 y = a0 + a1x +a2x2
//=== === === === === ==== === === === === === === =// letter Description// function name : Correlation// Function functions : Calculation least squares polynomial fitting of the correlation coefficient// Use : int M------ polynomial fitting stage (known condition)//* b--- double fitting song The coefficient, Higher-order the order on grounds of low order (known condition)//* double-node x x axis data (known to be pieces)// double* y--- node y-axis data (known condition)//* double FSL-- Nodes estimates, Number m (process variables)// int m------ node number (known condition)// Note : polynomial order of a maximum of 10. polynomials in the form of y = a0 a1x a2x2 //==================== ======================================== (2006-10-27, C/C++, 1KB, 下载75次)
Bayesian Filter.贝叶斯（Bayesian）滤波器的C++类库。包括卡尔曼滤波（kalman filter）、粒子滤波(particle filter)等。
Bayesian Filter. Bayesian (Bayesian) filters C Class. Including Kalman filter (Kalman filter). particle filter (particle filter). (2006-10-03, C/C++, 124KB, 下载1186次)
试写一算法,实现顺序表的就地逆置,即利用原表的存储空间将线性表(a1,a2,...,an)逆置为(an,an-1,...,a1).
try to write an algorithm to achieve the order form in situ reverse home, namely the use of the original table of linear storage space (a1, a2 ,..., an) inverse home (an, an-1 ,..., a1). (2005-06-24, C/C++, 1KB, 下载17次)