CSP认证201712-1

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1000+10;
int a[maxn];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%d",&a[i]);
	int minsub = 10000;  //设定两个不超过10000的正整数的差值最小为10000，因为差值或者其绝对值不会超过这个值 
	for(int i=0;i<n;i++)
	{
		for(int j=i+1;j<n;j++)
		{
			int sub = a[i]-a[j];   //计算差值 
			if(abs(sub)<=minsub)   //与设定的最小差值比较 
			{
				minsub = abs(sub);  //满足条件，更新最小差值 
			}
		}
	}
	printf("%d\n",minsub);
	return 0;
}