https://nanti.jisuanke.com/t/T1483

目前得分是 90 pts，死活不知道最后一个点挂在哪里了。求大佬帮忙 DUB /kel

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[100050];
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+n+1);
    int m=unique(a+1,a+n+1)-a-1;
    if(m==1){cout<<0;return 0;}
    int mn=a[1],mx=a[m],fn=a[2],fx=a[m-1];
    // cout<<mn<<" "<<mx<<" "<<fn<<" "<<fx<<"\n";
    // cout<<mx-fn<<" "<<fx-mn<<"\n";
    cout<<min(mx-fn,fx-mn)<<"\n";
    return 0;
}