1 //#pragma comment(linker, "/STACK:102400000, 102400000") 2 #include <algorithm> 3 #include <iostream> 4 #include <cstdlib> 5 #include <cstring> 6 #include <cstdio> 7 #include <vector> 8 #include <cmath> 9 #include <ctime>10 #include <list>11 #include <set>12 #include <map>13 using namespace std;14 typedef long long LL;15 typedef pair <int, int> P;16 const int N = 1e5 + 5;17 int a[N];18 19 int main()20 {21     int t, n;22     scanf("%d", &t);23     while(t--) {24         scanf("%d", &n);25         for(int i = 1; i <= n; ++i) {26             scanf("%d", a + i);27         }28         int Max = 1, num = a[1];29         for(int i = 2; i <= n; ++i) {30             if(Max % 2 && a[i] < num) {31                 Max++;32             } else if(Max % 2 == 0 && a[i] > num) {33                 Max++;34             }35             num = a[i];36         }37         printf("%d\n", Max);38     }39     return 0;40 }