CodeForce-Solved-Problem/A_Jagged_Swaps.cpp at master · vikashship/CodeForce-Solved-Problem · 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
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        vector<int> a(n);
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        bool sorted = false;
        while (!sorted)
        {
            sorted = true;
            for (int i = 1; i < n - 1; i++)
            {
                if (a[i - 1] < a[i] && a[i] > a[i + 1])
                {
                    swap(a[i], a[i + 1]);
                    sorted = false;
                }
            }
        }
        bool ok = true;
        for (int i = 0; i < n - 1; i++)
        {
            if (a[i] > a[i + 1])
            {
                ok = false;
                break;
            }
        }
        if (ok)
        {
            cout << "YES\n";
        }
        else
        {
            cout << "NO\n";
        }
    }
    return 0;
}