1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <set>
#include <unordered_map>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

#define pb push_back
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;

using namespace std;

//ora.in3 -> 2137

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  int t;
  cin >> t;
  while (t --> 0) {
  int n, ai;
  cin >> n;

  vector<int> nums;
  for (int i=0; i<n; ++i) {
    cin >> ai;
    nums.pb(ai);
  }
  int size = nums.size();

  int inc = 1;
  int half = (n+1) / 2;
  if (n % 2 == 1) inc = 0; 

  int left=0, right=size-1;
  int lc=0, rc=0;
  int answer = 2 * size + 1, count = 0, maxc=1;
  for (int s=n; s>=1; s--) {
    while (nums[left] < half) {
      left++;
      lc++;
    }
    while (nums[right] < half) {
      right--;
      rc++;
    }

    int val = s + lc + rc;
    //cout << "ANS " << val << " ===> " << min(maxc, val - size + 1) << endl;
    //cout << "DBG " << lc << ":" << rc << " <- " << s << endl;
    if (val >= size) {
      int mm = min(lc, rc);
      count += min(mm+1, min(maxc, val - size + 1));
    }

    maxc++;
    if (inc == 1) {
      inc = 0;
      half++;
    } else { inc = 1; }
  }

  cout << answer << " " << count << endl;

  }
  return 0;
}