题意:给n个数字,求每个数的左右两边离它最近的并且是它的倍数的乘积之和
思路分析:按照题解的方法解,最坏时间复杂度为O(10^5 *sqrt(10^5)),时限是1s,理论上来说会超时,但运行结果只跑了171ms,搞不懂为什么
思路分析:按照题解的方法解,最坏时间复杂度为O(10^5 *sqrt(10^5)),时限是1s,理论上来说会超时,但运行结果只跑了171ms,搞不懂为什么
思路是这样的,从左往右遍历求b[],从右往左遍历求c[],在遍历的过程中,用vis[]记录当前状态下,数字i的离它最近的倍数的位置。
代码如下:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define LL __int64
#define N 100005
#define inf 0x7ffffff
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
int a[N],b[N],c[N],vis[N];
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int n;
while(scanf("%d",&n) && n)
{
int i, j;
for(i = 1; i <= n; i++)
scanf("%d",&a[i]);
memset(vis,0,sizeof(vis));
for(i = 1; i <= n; i++)
{
if(vis[a[i]]) b[i] = a[vis[a[i]]];
else b[i] = a[i];
int m = (int)sqrt(0.5+a[i]);
for(j = 1; j <= m; j++)
if(a[i]%j == 0)
{
vis[j] = i;
vis[ a[i]/j ] = i;
}
}
memset(vis,0,sizeof(vis));
for(i = n; i >= 1; i--)
{
if(vis[a[i]]) c[i] = a[vis[a[i]]];
else c[i] = a[i];
int m = (int)sqrt(0.5+a[i]);
for(j = 1; j <= m; j++)
if(a[i]%j == 0)
{
vis[j] = i;
vis[a[i]/j] = i;
}
}
LL ans = 0;
for(i = 1; i <= n; i++)
ans += 1LL*b[i]*c[i];
printf("%I64d\n",ans);
}
return 0;
}