构造题(构造

构造题(构造

// Problem: 构造题// Contest: NowCoder// URL: Memory Limit: 524288 MB// Time Limit: 2000 ms// 2022-02-18 19:16:46// // Powered by CP Editor (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#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 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然后枚举。每一种可能性。从大到小进行枚举

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。