OO’s Sequence
In each test case:
First line: an integer n(n<=10^5) indicating the size of array
Second line:contain n numbers ai(0<ai<=10000)
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int mod = 1e9+7;
#define ll long long
#define N 100005
ll left[N],right[N];
int n,num[N],pre[N];
int main()
{
while(scanf("%d",&n)!=EOF){
for(int i=1;i<=n;i++){
scanf("%d",&num[i]);
left[i]=1;
right[i]=n;
}
memset(pre,0,sizeof(pre));
for(int i=1;i<=n;i++){
for(int j=num[i];j<=10000;j+=num[i]){
if(pre[j]&&right[pre[j]]==n)
right[pre[j]]=i-1;
}
pre[num[i]]=i;
}
memset(pre,0,sizeof(pre));
for(int i=n;i>=1;i--){
for(int j=num[i];j<=10000;j+=num[i]){
if(pre[j]&&left[pre[j]]==1)
left[pre[j]]=i+1;
}
pre[num[i]]=i;
}
long long ans=0;
for(int i=1;i<=n;i++)
ans = (ans%mod+(long long)(i-left[i]+1)*(right[i]-i+1)%mod)%mod;
printf("%lld\n",ans);
}
return 0;
}