爆零祭
#include<iostream>
using namespace std;
long long maxn=-1;
long long minn=3000000000;
int n;
int a[10000010];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int j=1;j<=n;j++)
{
if(a[j]>maxn)maxn=a[j];
if(a[j]<minn)minn=a[j];
}
long long qu=maxn-minn+1;
cout<<qu<<endl;
return 0;
} 
查看7道真题和解析
