不就是求最大值和最小值吗，简单！

已AC，请放心食用

#include <iostream>
using namespace std;
int main()
{
    int n, a[101], maxn = 0, minn = 10000000;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        if (a[i] > maxn)
        {
            maxn = a[i];
        }
        if (a[i] < minn)
        {
            minn = a[i];
        }
    }
    cout << maxn - minn;
    return 0;
}

方法①

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, a[105], maxn = 0, minn = 99999;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        if (a[i] > maxn)
        {
            maxn = a[i];
        }
        if (a[i] < minn)
        {
            minn = a[i];
        }
    }
    cout << maxn - minn;
    return 0;
}

方法②：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    cout << 2;
    return 0;
}

已全部AC ，可以放心食用。

#include <bits/stdc++.h>
using namespace std;
int n, a[105];
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    sort (a + 1, a + n + 1);
    cout << a[n] - a[1];
    return 0;
}

本人习惯数组从1开始使用

简单

L6知识

#include <iostream>//hetao3097453
using namespace std;
int a[101];
int main()
{
    int n,maxx = -1,minn = 9999;
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }
    for(int i = 1;i <= n;i++)
    {
        maxx = max(maxx,a[i]);
        minn = min(minn,a[i]);
    }
    cout << maxx - minn << endl;
    return 0;
}