如题

#include<stdio.h>
#include<math.h>
long long max(long long p, long long q);
long long min(long long h, long long k);

int main()
{
    long long a[10000001] = { 0 };
    long long s1[10000001], s2[10000001];
    long long i,n,sum=0;
    long long mx=0, mn=11000000000000000001ll;
    scanf("%lld", &n);
    for ( i = 1; i <=n; i++)
    {
        scanf("%lld", &a[i]);
    }
    for (i = 1; i <= n; i++)
    {
        mx = max(mx, a[i]);
        mn = min(mn, a[i]);
    }
    for (i = 1; i <= n; i++)
    {
        s1[i] = mx - a[i];
        s2[i] = a[i] - mn;
    }
    for (i = 1; i <= n; i++)
    {
        printf("%lld ", s1[i]);
    }

    printf("\n");
    for (i = 1; i <= n; i++)
    {
        printf("%lld ", s2[i]);
    }
    return 0;
}
long long max(long long p, long long q)
{
    long long result;
    if (p >= q)
        result = p;
    else
        result = q;
    return result;
}
long long min(long long h, long long k)
{
    long long result2;
    if (h >= k)
        result2 = k;
    else
        result2 = h;
    return result2;
}