代码搜索：序列信号
找到约 10,000 项符合「序列信号」的源代码
代码结果 10,000
www.eeworm.com/read/139177/13185437
txt 误差变化序列.txt
23.015493 19.461021 19.013114 18.537079 17.952813 17.124513 16.005074
14.836126 13.809940 12.933407 12.198354 11.592178
www.eeworm.com/read/138665/13226581
txt 误差变化序列.txt
19.777905 18.436832 18.228743 18.069990 17.916949 17.727241 17.450876
17.021536 16.359790 15.393156 14.085351 12.493059
www.eeworm.com/read/478955/6708567
txt 最长子序列.txt
//最长单调子序列,复杂度O(nlogn)
//注意最小序列覆盖和最长序列的对应关系,例如
//"define _cp(a,b) ((a)>(b))"求解最长严格递减序列,则
//"define _cp(a,b) (!((a)>(b)))"求解最小严格递减序列覆盖
//可更改元素类型和比较函数
#define MAXN 10000
#define _cp(a,b) ((a)>(b))
www.eeworm.com/read/403717/11512680
txt 最长子序列.txt
//最长单调子序列,复杂度O(nlogn)
//注意最小序列覆盖和最长序列的对应关系,例如
//"define _cp(a,b) ((a)>(b))"求解最长严格递减序列,则
//"define _cp(a,b) (!((a)>(b)))"求解最小严格递减序列覆盖
//可更改元素类型和比较函数
#define MAXN 10000
#define _cp(a,b) ((a)>(b))
www.eeworm.com/read/400753/11569468
txt 最长子序列.txt
//最长单调子序列,复杂度O(nlogn)
//注意最小序列覆盖和最长序列的对应关系,例如
//"define _cp(a,b) ((a)>(b))"求解最长严格递减序列,则
//"define _cp(a,b) (!((a)>(b)))"求解最小严格递减序列覆盖
//可更改元素类型和比较函数
#define MAXN 10000
#define _cp(a,b) ((a)>(b))
www.eeworm.com/read/259776/11764610
txt 纵横点阵序列.txt
0=
1=
0011011111111011001100110011001100110011
0011011111111011001100110011001100110011
0011011111111011001100110011001100110011
0011011111111011001100110011001100110011
0011011111111011
www.eeworm.com/read/156416/11804907
cpp 公共子序列.cpp
#include
char x[8]={' ','A','B','C','B','D','A','B'};
char y[7]={' ','B','D','C','A','B','A'};
int l[8][7];
char b[8][7];
void main ()
{
int i;
cout
www.eeworm.com/read/257467/11925470
txt 理想采样序列.txt
n=0:50;
A=444.128;
a=50*sqrt(2.0)*pi;
T=0.001;
w0=50*sqrt(2.0)*pi;
x=A*exp(-a*n*T).*sin(w0*n*T);
close all
subplot(3,1,1);stem(x);
title('理想采样信号序列');
k=-25:25;
W=(pi/12.5)*k;
X=x*(exp(-j*pi