就很简单啊
查看原帖
就很简单啊
1019333
xf666楼主2024/4/11 20:13

#直接代码

#include <bits/stdc++.h>
using namespace std;
long long n, a[100001], i, d = 0X3f3f3f3f;
int main() {
	cin >> n;
	for (i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a, a + n);
	for (i = 1; i < n; i++) {
		d = min(d, a[i] - a[i - 1]);
	}
	if(d==0)
	{
		cout<<n;
	}
else
	cout << (a[n - 1] - a[0]) / d + 1;
	return 0;
}
2024/4/11 20:13
加载中...