构造题(构造

// Problem: 构造题
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/11197/A
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 2022-02-18 19:16:46
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fir first
#define pb push_back
#define sec second
#define sortall(x) sort((x).begin(),(x).end())
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
const int N = 1e6 + 10;

int n;
int a[N];

int gcd (int a, int b) {
    return b?gcd(b, a % b) : a;
}
void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + 1 + n);
    int maxv = max(gcd(a[1], a[2]), gcd(a[1], a[2] + 1));
    maxv = max(maxv, gcd(a[1] + 1, a[2]));
    maxv = max (maxv, gcd(a[1] + 1, a[2] + 1));
    for (int i = maxv; i >= 1; i --) {
       int t = i;
        bool f= 1;
        for (int j = 1; j<= n; j++)
            if (gcd(t, a[j]) != t && gcd(t, a[j] + 1) != t)
                f = 0;
        if (f) {
            cout << i << endl;
            return;
        } 
    }
}
int main () {
    int t;
    t = 1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

通过确定最小的gcd然后枚举。每一种可能性。从大到小进行枚举