每个数找他前后最接近的他且是他倍数的数如果没有就是自己,然后输出这些数相乘加起来。
方法是用一个数轴全置-1,从左往右遍历,到一个数,看数轴上这个数上是否是-1,是,则b[i]为i,反之b[i]=数轴上这个数,然后在数轴上把这个数的所有约数全部置为i,如此,求c[i]就是反过来扫一遍。
复杂度n根号n。
AC代码:
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<ctime>
#include<string.h>
#include<string>
using namespace std;
#define ll __int64
#define eps 1e-8
int a[100005];
int vis[100005];
int b[100005],c[100005];
int main()
{
#ifdef GLQ
freopen("input.txt","r",stdin);
// freopen("o.txt","w",stdout);
#endif // GLQ
int n,i,j;
while(~scanf("%d",&n)&&n)
{
for(i = 0; i < n; i++)
scanf("%d",&a[i]);
memset(vis,-1,sizeof(vis));
for(i = 0; i < n; i++)
{
if(vis[a[i]] != -1) b[i] = vis[a[i]];
else b[i] = i;
// cout<<"b["<<i<<"]="<<a[b[i]]<<endl;
for(j = 1; j <= (int)sqrt(double(a[i])+0.5); j++) if(a[i]%j == 0)
vis[j] = vis[a[i]/j] = i;
}
memset(vis,-1,sizeof(vis));
for(i = n-1; i >= 0; i--)
{
if(vis[a[i]] != -1) c[i] = vis[a[i]];
else c[i] = i;
// cout<<"c["<<i<<"]="<<a[c[i]]<<endl;
for(j = 1; j <= (int)sqrt(double(a[i])+0.5); j++)if(a[i]%j == 0)
vis[j] = vis[a[i]/j] = i;
}
ll ans = 0;
for(i = 0; i < n; i++) ans += (ll)a[b[i]]*(ll)a[c[i]];
printf("%I64d\n",ans);
}
return 0;
}