213. 大牛们的午饭

#include <cstdio>
#include <iostream>
#define max 1000100
#define MAX(x, y) (x) > (y) ? (x) : (y)
#define For(i, m, n) for (i = m; i < n; ++i)
using namespace std;
int a[max], b[max], c[max];
int main(void) {
	int t, n, sum, i;
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		sum = 0;
		For(i, 0, n) {
			b[i] = c[i] = 1;
			scanf("%d", &a[i]);
		}
		For(i, 1, n) {
			if (a[i - 1] < a[i]) b[i] = b[i - 1] + 1;
			else b[i] = 1;
		}
		for(i = n - 2; i >= 0; --i) {
			if (a[i + 1] < a[i]) c[i] = c[i + 1] + 1;
			else c[i] = 1;
		}
		For(i, 0, n) sum += MAX(b[i], c[i]);
		printf("%d\n", sum);
	}
	return 0;
}