CodeForces/A_LRC_and_VIP.cpp at master · Ash8389/CodeForces · GitHub

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
#include <bits/stdc++.h>
using namespace std;

void solve()
{
    int n;
    cin >> n;

    vector<int> arr(n);
    int same = 1;
    int maxi_idx = 0;

    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
        maxi_idx = arr[i] > arr[maxi_idx] ? i : maxi_idx;
        if (i > 0)
        {
            if (arr[i] != arr[i - 1])
            {
                same = 0;
            }
        }
    }

    if (same)
    {
        cout << "NO" << endl;
        return;
    }

    cout << "YES" << endl;

    for (int i = 0; i < n; i++)
    {
        if (i == maxi_idx)
        {
            cout << "2" << " ";
        }
        else
        {
            cout << "1" << " ";
        }
    }

    cout << endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;

    while (t--)
    {
        solve();
    }

    return 0;
}