好久没更新了
题目大意:
求这个式子
之前写过一个多次询问,每次询问是求区间内所有子区间的gcd的和(HDU5381)是利用gcd的特性然后莫队维护的
GCD的特性: 一段区间内的gcd的数值不会出现超过log种,而且相等的都挨着
因为遇到一个数要么不变,要么至少减少一半
知道了这个性质之后再来看看这个式子
我们可以枚举每个a[i]作为最大值的贡献,也就是说a[i]作为区间最大值控制的区间是[L,R]的话求区间[L,R]对答案的贡献
假设当前最大值的位置为pos,作为最大值控制的左右区间为[L,R]
如果gcd(pos,i)!=gcd(pos,i+1)那么i这个位置就要储存起来,左边同理
在[L,pos]种找出哪些的点的gcd是变化的
在[pos,R]找出哪些点的gcd是变化的
然后log*log枚举这些点算贡献
假设在L1出gcd的值发生变化,R1出的gcd的值发生变化
贡献 = MAXgcd(L1处的gcd,R1处的gcd)(L1段的长度)*(R1段的长度)
总复杂度O(n* logn * logn)
细节!:
注意单调栈求每个数控制的左右端点的时候,注意区间重复问题
分治
这里给出分治的解法,其实和上述做法是一样的,
从[1,n]开始,每次找[l,r]里最大值的位置m,再找一下[l,m]和[m,r]里gcd改变的位置,比如说[l,m]里gcd[p,m]!=gcd[p+1,m]的位置
最后枚举一下[l,m]和[m,r]里gcd改变的位置就可以了,处理完再处理区间[l,m-1]和[m+1,r]然后就ok了
CODE:
#pragma GCC optimize(2)
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
#define debug(x) cout << #x << ":" << x << endl;
#define mst(x, a) memset(x, a, sizeof(x))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
ll mod = 1e9 + 7;
ll n, a[maxn];
ll Log[maxn];
ll gcd[maxn][20];
void GetLog() {
int i;
Log[1] = 0;
for (i = 2; i <= n + 1; ++i)
Log[i] = Log[i / 2] + 1;
}
void RMQ() {
ll i, j;
for (i = 1; i <= n; ++i)
gcd[i][0] = a[i];
for (j = 1; (1 << j) <= n; ++j)
for (i = 1; i + (1 << (j - 1)) <= n; ++i)
gcd[i][j] = __gcd(gcd[i][j - 1], gcd[i + (1 << (j - 1))][j - 1]);
}
ll qgcd(ll l, ll r) {
ll k = Log[r - l + 1];
return __gcd(gcd[l][k], gcd[r - (1 << k) + 1][k]);
}
ll RR, LL;
ll search_L(ll l, ll r, ll t) {
ll ans;
while (l <= r) {
ll mid = (l + r) >> 1;
if (qgcd(mid, RR) == t)
r = mid - 1, ans = mid;
else
l = mid + 1;
}
return ans;
}
ll search_R(ll l, ll r, ll t) {
ll ans;
while (l <= r) {
ll mid = (l + r) >> 1;
if (qgcd(LL, mid) == t)
l = mid + 1, ans = mid;
else
r = mid - 1;
}
return ans;
}
ll st[maxn], L[maxn], R[maxn];
ll le[maxn], ri[maxn];
ll cal(ll l, ll r, ll x) {
ll res = 0;
ll cnt_l = 0, cnt_r = 0;
ll l1 = l, r1 = x;
RR = x;
while (l1 <= r1) {
int t = search_L(l1, r1, qgcd(r1, x));
le[++cnt_l] = t;
r1 = t - 1;
}
l1 = x, r1 = r;
LL = x;
while (l1 <= r1) {
ll t = search_R(l1, r1, qgcd(x, l1));
ri[++cnt_r] = t;
l1 = t + 1;
}
ri[0] = x - 1;
le[0] = x + 1;
for (int i = 1; i <= cnt_l; i++) {
for (int j = 1; j <= cnt_r; j++) {
if (le[i] == x && ri[j] == x)
res = (res + a[x]) % mod;
else
res = (res + (((qgcd(le[i], ri[j]) * (ri[j] - ri[j - 1] ))%mod) * (le[i - 1] - le[i]))%mod) % mod;
}
}
return res%mod;
}
int main() {
scanf("%lld", &n);
rep(i, 1, n) scanf("%lld", &a[i]);
GetLog(), RMQ();
ll top = 0;
for (int i = 1; i <= n; i++) {
while (top && a[i] >= a[st[top]])
top--;
L[i] = st[top] + 1;
st[++top] = i;
}
top = 0, st[0] = n + 1;
for (int i = n; i >= 1; i--) {
while (top && a[i] > a[st[top]])
top--;
R[i] = st[top] - 1;
st[++top] = i;
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
int l = L[i];
int r = R[i];
ans = (ans + a[i] * cal(l, r, i)%mod) % mod;
}
printf("%lld", ans);
return 0;
}
/*
5
48 72 70 60 48
4
100000000 50000000 2500000 125
*/