POJ 3298 Antimonotonicity (思维)

//#pragma comment(linker, "/STACK:102400000, 102400000")
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
typedef pair <int, int> P;
const int N = 1e5 + 5;
int a
;

int main()
{
int t, n;
scanf("%d", &t);
while(t--) {
scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
int Max = 1, num = a[1];
for(int i = 2; i <= n; ++i) {
if(Max % 2 && a[i] < num) {
Max++;
} else if(Max % 2 == 0 && a[i] > num) {
Max++;
}
num = a[i];
}
printf("%d\n", Max);
}
return 0;
}