#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
vector<int> heights(n);
for (int i = 0; i < n; ++i) {
cin >> heights[i];
}
int maxLength = 0;
// Try adjusting each possible subarray
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
int minHeight = *min_element(heights.begin() + i, heights.begin() + j + 1);
int maxHeight = *max_element(heights.begin() + i, heights.begin() + j + 1);
// Check if it's possible to adjust the subarray by modifying it
if (maxHeight - minHeight <= j - i) {
maxLength = max(maxLength, j - i + 1);
}
}
}
cout << maxLength << endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgaW50IFQ7CiAgICBjaW4gPj4gVDsKICAgIAogICAgd2hpbGUgKFQtLSkgewogICAgICAgIGludCBuOwogICAgICAgIGNpbiA+PiBuOwogICAgICAgIAogICAgICAgIHZlY3RvcjxpbnQ+IGhlaWdodHMobik7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyArK2kpIHsKICAgICAgICAgICAgY2luID4+IGhlaWdodHNbaV07CiAgICAgICAgfQoKICAgICAgICBpbnQgbWF4TGVuZ3RoID0gMDsKICAgICAgICAKICAgICAgICAvLyBUcnkgYWRqdXN0aW5nIGVhY2ggcG9zc2libGUgc3ViYXJyYXkKICAgICAgICBmb3IgKGludCBpID0gMDsgaSA8IG47ICsraSkgewogICAgICAgICAgICBmb3IgKGludCBqID0gaTsgaiA8IG47ICsraikgewogICAgICAgICAgICAgICAgaW50IG1pbkhlaWdodCA9ICptaW5fZWxlbWVudChoZWlnaHRzLmJlZ2luKCkgKyBpLCBoZWlnaHRzLmJlZ2luKCkgKyBqICsgMSk7CiAgICAgICAgICAgICAgICBpbnQgbWF4SGVpZ2h0ID0gKm1heF9lbGVtZW50KGhlaWdodHMuYmVnaW4oKSArIGksIGhlaWdodHMuYmVnaW4oKSArIGogKyAxKTsKICAgICAgICAgICAgICAgIAogICAgICAgICAgICAgICAgLy8gQ2hlY2sgaWYgaXQncyBwb3NzaWJsZSB0byBhZGp1c3QgdGhlIHN1YmFycmF5IGJ5IG1vZGlmeWluZyBpdAogICAgICAgICAgICAgICAgaWYgKG1heEhlaWdodCAtIG1pbkhlaWdodCA8PSBqIC0gaSkgewogICAgICAgICAgICAgICAgICAgIG1heExlbmd0aCA9IG1heChtYXhMZW5ndGgsIGogLSBpICsgMSk7CiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgIH0KICAgICAgICB9CgogICAgICAgIGNvdXQgPDwgbWF4TGVuZ3RoIDw8IGVuZGw7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0K