Codeforces Round #835(div4) A~E补题

A. Medium Number

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T;
ll a[100000];
int main()
{
    cin >> T;
    while (T--)
    {
        
    
        
        for (int i = 0; i < 3; i++)
        {
           cin >> a[i];
        }
        sort (a, a + 3);
        cout << a[1] << endl;
    }
    return 0;
}

B. Atilla’s Favorite Problem

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T, n;
char a;
ll f;
int main()
{
    cin >> T;
    while (T--)
    {
        cin >> n;
        f = 0;
        for (int i = 0; i < n; i++)
        {
            cin >> a;
            if (a - 'a' >= f)
                f = a - 'a' + 1;
        }
        cout << f << endl;
    }
    return 0;
}

C. Advantage

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6+10;
ll a[N], b[N];
int main()
{
    ll T, n;
    cin >> T;
    while (T--)
    {
        cin >> n;
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
            b[i] = a[i];
        }
        sort (b, b + n);
        for (int i = 0; i < n; i++)
        {
            if (a[i] != b[n - 1])
                printf ("%d ", a[i] - b[n - 1]);
            else
                printf ("%d ", a[i] - b[n - 2]);
        }
        cout << endl;
    }
    return 0;
}

D. Challenging Valleys

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6+10;
ll a[N];
int main()
{
    ll T, n;
    cin >> T;
    while (T--)
    {
        int f = 0, ans = 0;
        cin >> n;
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        for (int i = 1; i < n; i++)
        {
            if (a[i] > a[i - 1])
                f = 1;
            if (f == 1 && a[i] < a[i - 1])
                {
                    ans = 1;
                    break;
                }
        }
        if (ans)
            puts ("NO");
        else    
            puts ("YES");
    }
    return 0;
}

E. Binary Inversions

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+10;
ll a[N];
ll cnt[N];
ll T, n;
ll inversion ()
{
    memset (cnt, 0, sizeof cnt);
    ll num = 0, sum = 0;
    for (int i = n; i > 0; i--)
    {
        if (!a[i])
            num++;
        else    
            cnt[i] = num;
    }
    for (int i = 1; i <= n; i++)
    {
        sum += cnt[i];
    }
    return sum;
}
int main()
{
    ll ans1, ans2, ans3;
    cin >> T;
    while (T--)
    {
        ll sum1 = 0, sum0 = 0;
        cin >> n;
        int f = 0, f1 = 0, f0 = 0;
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
            if (!f && !a[i])
            {
                f = 1;
                f0 = i;
            }
            if (a[i])
                f1 = i;
        }
        ans1 = inversion ();
        a[f0] = 1;
        ans2 = inversion ();
        a[f0] = 0;
        a[f1] = 0;
        ans3 = inversion ();
        cout << max ({ans1, ans2, ans3}) <<endl;
    }
    return 0;
}