最長上升子序列
非常經典的問題。
給定的整數序列，請求出其最長上升子序列的長度。
有多個測試用例。每個測試用例由一個行整數組成，其中第一個是一個整數 n (1 ≤ n ≤ 10000)，表示給定序列的長度。然后是 n 個 32-bits 帶符號整數表示序列中的元素。
輸入直至沒有數據或者遇到長度 n 是非正數為止。
Abtract - We propose a new family of fi lter banks,
named NDFB, that can achieve the directional decomposition
of arbitrary N-dimensional (N ≥ 2) signals with a simple and
effi cient tree-structured construction.
NetGUI v0.4.1
INSTALL Instructions
Pedro de las Heras Quiros
pheras@gmail.com
1. Install netkit (www.netkit.org)
2. Compile src/*java
3. mv src/*class bin
4. Edit and adapt bin/netgui.sh
5. Run bin/netgui.sh
#include <iostream>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
long long n;
cin>>n;
if(n%2==1)
cout<<(n*n-1)/4<<endl;
else if (n%4==0)
cout <<(n*n)/4-1<<endl;
else{
if(n==2)
cout<<1<<endl;
else{
long long k=n/2-1;
cout <<k*k+2*k-3<<endl;
}
}
}
return 0;
}
Use
the fast Fourier transform function fft to analyse following signal. Plot the original signal, and the magnitude of its
spectrum linearly and logarithmically. Apply Hamming window to reduce the
leakage.
.
The hamming window can be coded in Matlab as
for n=1:N
hamming(n)=0.54+0.46*cos((2*n-N+1)*pi/N);
end;
where
N is the data length in the FFT.
Computes all eigenvalues and eigenvectors of a real symmetric matrix a,
! which is of size n by n, stored in a physical np by np array.
! On output, elements of a above the diagonal are destroyed.
! d returns the eigenvalues of a in its first n elements.
! v is a matrix with the same logical and physical dimensions as a,
! whose columns contain, on output, the normalized eigenvectors of a.
! nrot returns the number of Jacobi rotations that were required.
! Please notice that the eigenvalues are not ordered on output.
! If the sorting is desired, the addintioal routine "eigsrt"
! can be invoked to reorder the output of jacobi.
