acwing过不了, 蓝桥居然100分====
C++ 代码
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5;
int a[N];
int n;
int main()
{
cin >> n;
for(int i = 0; i< n; i++) scanf("%d", &a[i]);
sort(a, a + n);
int mint = 1e8;
for(int i = 0; i + 1< n; i++)
{
int dt = a[i + 1] - a[i];
mint = min(mint, dt);
}
int res = a[0],cnt = 1;
if(mint != 0)
{
while(res < a[n -1])
{
res += mint;
cnt ++;
}
}
else cnt = n;
cout <<cnt ;
return 0;
}