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
83
| #include <bits/stdc++.h>
#define R register
#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
#define meow(cat...) fprintf(stderr, cat)
const int MaxN = 4e5 + 10;
std::vector<int> v;
std::unordered_map<int, int> cnt;
int premax[MaxN], sufmax[MaxN];
int n, flag, a[MaxN], l[MaxN], r[MaxN];
void init()
{
cnt.clear();
for(int i = 0; i <= n + 9; i++)
l[i] = r[i] = premax[i] = sufmax[i] = 0;
}
inline int read()
{
int x = 0;
char ch = getchar();
while (ch > '9' || ch < '0')
ch = getchar();
while (ch <= '9' && ch >= '0')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
return x;
}
signed main()
{
int T = read();
while (T--)
{
n = read(), flag = 0, init();
for (int i = 1; i <= n; i++)
a[i] = read(), cnt[a[i]] += 1,
premax[i] = std::max(premax[i - 1], a[i]);
v.clear(), v.push_back(0);
for(int i = 1; i <= n; i++)
{
while(v.size() && a[v.back()] >= a[i])
v.pop_back();
l[i] = v.back(), v.push_back(i);
}
v.clear(), v.push_back(n + 1);
for(int i = n; i; i--)
{
while(v.size() && a[v.back()] >= a[i])
v.pop_back();
r[i] = v.back(), v.push_back(i);
}
for(int i = n; i; i--)
sufmax[i] = std::max(sufmax[i + 1], a[i]);
std::reverse(sufmax + 1, sufmax + n + 1);
for(int i = 2; i < n; i++)
{
int l1 = std::lower_bound(premax + 1, premax + n + 1, a[i]) - premax;
int r1 = std::upper_bound(premax + 1, premax + n + 1, a[i]) - premax - 1;
int r2 = n + 1 - (std::lower_bound(sufmax + 1, sufmax + n + 1, a[i]) - sufmax);
int l2 = n + 1 - (std::upper_bound(sufmax + 1, sufmax + n + 1, a[i]) - sufmax) + 1;
if(l[i] > r1 || l1 > r[i] || l[i] > r2 || l2 > r[i] || l1 >= i || r2 <= i
|| l1 > r1 || l2 > r2 || cnt[a[i]] < 3) { continue; }
int a = 0, b = 0;
for(int j = i - 1; j >= l[i]; j--)
if(l1 <= j && j <= r1)
if(l[i] <= j + 1 && j + 1 <= r[i]) { a = j; break; }
for(int j = i - a; a + j <= r[i]; j++)
if(l2 <= j + a + 1 && j + a + 1 <= r2)
if(l[i] <= j + a && j + a <= r[i]) { b = j; break; }
printf("YES\n%d %d %d\n", a, b, n - a - b), flag = 1; break;
}
if(!flag) puts("NO");
}
return 0;
}
|