#include<bits/stdc++.h>
#include <vector>
using namespace std;

int main() {
    int t, n;
    cin >> t;
    while (t--) {
        cin >> n;
        vector<int> b(n);
        for (int i = 0; i < n; i++) {
            cin >> b[i];
        }

        int m = 0;
        int l = 0, r = 0;
        while (r < n) {
            if (b[l] <= b[r]) {
                m = max(m, r- l);
                if (r == n-1) {
                    l++;
                }
                r++;
            } else {
                l++;
            }
        }
        
        cout << m<< endl;
    }
    return 0;
}