#include int main() { int T; int N; int A[200]; int ul, ud, up; int dl, dd, dp; std::cin >> T; for(int i = 0; i < T; ++i) { std::cin >> N; for(int j = 0; j < N; ++j) { std::cin >> A[j]; } ud = 0; dd = 1000000001; ul = dl = 1; up = dp = A[0]; //std::cout << "l p d" << std::endl; //std::cout << dl << " " << dp << " " << dd << std::endl; //std::cout << ul << " " << up << " " << ud << std::endl; //std::cout << std::endl; for(int j = 1; j < N; ++j) { if( dd > dp - A[j] && dp > A[j] ) { dl++; dd = dp - A[j]; dp = A[j]; } if( ud < A[j] - up ) { ul++; ud = A[j] - up; up = A[j]; if( dl < ul ) { dl = ul; dd = 1000000001; dp = A[j]; } } //std::cout << "l p d" << std::endl; //std::cout << dl << " " << dp << " " << dd << std::endl; //std::cout << ul << " " << up << " " << ud << std::endl; //std::cout << std::endl; } std::cout << std::max(ul, dl) << std::endl; } return 0; }