What happens if the array is already sorted?

What happens if there are two indexes $$$i$$$ and $$$j$$$, such that $$$i < h$$$ and $$$a_i > a_j$$$?

#include <bits/stdc++.h>
using namespace std;
 
int main() {
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        int n;
        cin >> n;
        vector<int> a(n);
        for (auto& u : a)
            cin >> u;
        if (!is_sorted(a.begin(), a.end()))
            cout << "YES\n";
        else
            cout << "NO\n";
    }
}

What is happening after replacing a segment of length greater than $$$1$$$ with segment of length $$$1$$$?

The cost of the arrays $$$b_1, b_2, \ldots, b_k$$$ equals to $$$k + \sum_{i=1}^{k}{mex({b_i})}$$$.

#include <bits/stdc++.h>
using namespace std;
 
int main() {
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        int n;
        cin >> n;
        vector<int> a(n);
        for (auto& u : a)
            cin >> u;
 
        int ans = 0;
        for (int i = 0; i < n; i++) {
            ans += (i + 1) * (n - i);
            if (a[i] == 0)
                ans += (i + 1) * (n - i);
        }
        cout << ans << '\n';
    }
}