OO’s Sequence（多校第一场A题）

http://acm.hdu.edu.cn/showproblem.php?pid=5288

OO’s Sequence

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1698    Accepted Submission(s): 605

Problem Description

OO has got a array A of size n ,defined a function f(l,r) represent the number of i (l<=i<=r) , that there's no j(l<=j<=r,j<>i) satisfy a _i mod a _j=0,now OO want to know

∑i=1n∑j=inf(i,j) mod （109+7）.

 

Input

There are multiple test cases. Please process till EOF.
In each test case: 
First line: an integer n(n<=10^5) indicating the size of array
Second line:contain n numbers a _i(0<a _i<=10000)

 

Output

For each tests: ouput a line contain a number ans.

 

Sample Input

  
  

   
   5
1 2 3 4 5
  
  

 

Sample Output

  
  

   
   23
  
  

 

Author

FZUACM

 

Source

2015 Multi-University Training Contest 1

 

解析：题解见官方网址 ：   点击打开链接

AC code：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#define LL long long
#define MAXN 1000010
using namespace std;
int n,l,r,i,j;
int a[MAXN];
LL ans;
const int MOD=1e9+7;
vector<int>vec[MAXN];
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<=10010;i++)
		{
			vec[i].clear();
		}
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			vec[a[i]].push_back(i);
		}
		for(i=1;i<=n;i++)
		{
			sort(vec[a[i]].begin(),vec[a[i]].end());
		}
		ans=0;
		for(i=1;i<=n;i++)
		{
			int m=sqrt(a[i])+1;
			l=0;
			r=n+1;
			for(j=1;j<=m;j++)
			{
				if(a[i]%j==0)
				{
					if(vec[j].size()>0)
					{
						int pos1=lower_bound(vec[j].begin(),vec[j].end(),i)-vec[j].begin();
						int pos2=upper_bound(vec[j].begin(),vec[j].end(),i)-vec[j].begin();
						if(pos1>0)
						{
							l=max(l,vec[j][pos1-1]);
						}
						if(pos2<vec[j].size())
						{
							r=min(r,vec[j][pos2]);
						}
					}
					int t=a[i]/j;
					if(vec[t].size()>0)
					{
						int pos1=lower_bound(vec[t].begin(),vec[t].end(),i)-vec[t].begin();
						int pos2=upper_bound(vec[t].begin(),vec[t].end(),i)-vec[t].begin();
						if(pos1>0)
						{
							l=max(l,vec[t][pos1-1]);
						}
						if(pos2<vec[t].size())
						{
							r=min(r,vec[t][pos2]);
						}
					}
				}
			}
			if(i>=l&&i<=r)
				ans=(ans+(i-l)*(r-i))%MOD;
		}
		printf("%I64d\n",ans);
	}
	return 0;
 }