Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- #include <math.h>
- using namespace std;
- vector <int> t;
- int gcd(int a, int b) {
- return b ? gcd(b, a % b) : a;
- }
- int get(int v, int l, int r, int L, int R) {
- if (l > R || r < L)
- return 0;
- if (L <= l && R >= r)
- return t[v];
- int d1 = get(2 * v + 1, l, (l + r) / 2, L, R);
- int d2 = get(2 * v + 2, (l + r) / 2 + 1, r, L, R);
- return gcd(d1, d2);
- }
- int main() {
- int n, k;
- cin >> n >> k;
- int N = pow(2, ceil(log2(n)));
- t.resize(2 * N - 1, 0);
- for (int i = t.size() / 2; i < t.size() / 2 + n; i++)
- cin >> t[i];
- for (int i = t.size() / 2 - 1; i > -1; i--)
- t[i] = gcd(t[2 * i + 1], t[2 * i + 2]);
- //for (int i = 0; i < t.size(); i++)
- //cout << t[i] << " ";
- int ans = 1;
- for (int i = 0; i < n - k + 1; i++) {
- int c = get(0, t.size() / 2, t.size() - 1, t.size() / 2 + i, t.size() / 2 + i + k - 1);
- ans = max(ans, c);
- }
- cout << ans;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement