洛谷 P1154 奶牛分厩

#include <iostream>
#define MAX 5001

using namespace std;

const int m = 5e3 + 5;
const int k = 1e6 + 5;
int n;
int vis[k];
int num[m];


int main()
{
	int i;
	int j;
	cin >> n;
	int flag = 1;
	for (i = 1; i <= n; i++)
		cin >> num[i];
	for(i=1;i<=n;i++)
		for (j = i + 1; j <= n; j++)
		{
			int a= num[i] - num[j];
			if (a < 0) a = -a;
			vis[a] = 1;
		}
	for (i = n; i <= k; i++)
	{
		flag = 1;
		for (j = i; j <= k; j += i)
		{
			if (vis[j] == 1)
			{
				flag = 0;
				break;
			}
		}
		if (flag == 1)
		{
			cout << i;
			return 0;
		}
	}
}

设abs(a-b)=n*k;
则k是不可取的