#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

bool typetest;
inline void fastIOfileinput()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    typetest = 1;
}

const int N = 2e5 + 5;
int n, a[N];
int minn[N][19], maxn[N][19];

void Prepare()
{
    for (int i = 1; i <= n; ++i)
        minn[i][0] = maxn[i][0] = a[i];
    int loga = log2(n);
    for (int i = 1; i <= loga; ++i)
        for (int v = 1; v <= n - (1 << i) + 1; ++v)
        {
            maxn[v][i] = max(maxn[v][i - 1], maxn[v + (1 << (i - 1))][i - 1]);
            minn[v][i] = min(minn[v][i - 1], minn[v + (1 << (i - 1))][i - 1]);
        }
}

ll Get_min(int l, int r)
{
    int loga = log2(r - l + 1);
    return min(minn[l][loga], minn[r - (1 << loga) + 1][loga]);
}

ll Get_max(int l, int r)
{
    int loga = log2(r - l + 1);
    return max(maxn[l][loga], maxn[r - (1 << loga) + 1][loga]);
}

void Read()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    Prepare();
}

void Solve()
{
    for (int i = 1; i <= n - 2; ++i)
    {
        int l = 1, m, h = n;
        int v = Get_max(1, i);
        while (l <= h)
        {
            m = (l + h) / 2;
            if (Get_max(m, n) > v)
                l = m + 1;
            else
                h = m - 1;
        }
        int piv1 = l;
        h = n;
        while (l <= h)
        {
            m = (l + h) / 2;
            if (Get_max(m, n) < v)
                h = m - 1;
            else
                l = m + 1;
        }
        int piv2 = h;
        --piv1;
        --piv2;
        if (piv2 <= i)
            continue;
        piv1 = max(piv1, i + 1);
        l = piv1, h = piv2;
        while (l <= h)
        {
            m = (l + h) / 2;
            //cout << m << " " << Get_min(i + 1, m) << "\n";
            if (Get_min(i + 1, m) > v)
                l = m + 1;
            else
                h = m - 1;
        }
        //cout << i << ": " << piv1 << " " << piv2 << " " << v << " " << l << "\n";
        if (l <= piv2 && Get_min(i + 1, l) == v)
        {
            cout << "YES\n"
                 << i << " " << l - i << " " << n - l << "\n";
            return;
        }
    }
    cout << "NO\n";
}

int32_t main()
{
    fastIOfileinput();
    if (typetest)
    {
        int t;
        cin >> t;
        for (int v = 1; v <= t; ++v)
        {
            Read();
            Solve();
        }
    }
    else
    {
        Read();
        Solve();
    }
}