hdu 4961 枚举约数O(n*sqrt(n))
2015-03-13 12:48
316 查看
Boring Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1099 Accepted Submission(s): 517
Problem Description
Number theory is interesting, while this problem is boring.
Here is the problem. Given an integer sequence a1, a2, …, an, let S(i) = {j|1<=j<i, and aj is a multiple of ai}. If S(i) is not empty, let f(i) be the maximum integer in S(i); otherwise, f(i) = i. Now we
define bi as af(i). Similarly, let T(i) = {j|i<j<=n, and aj is a multiple of ai}. If T(i) is not empty, let g(i) be the minimum integer in T(i); otherwise, g(i) = i. Now we define ci as ag(i). The boring
sum of this sequence is defined as b1 * c1 + b2 * c2 + … + bn * cn.
Given an integer sequence, your task is to calculate its boring sum.
Input
The input contains multiple test cases.
Each case consists of two lines. The first line contains an integer n (1<=n<=100000). The second line contains n integers a1, a2, …, an (1<= ai<=100000).
The input is terminated by n = 0.
Output
Output the answer in a line.
Sample Input
5
1 4 2 3 9
0
Sample Output
136
HintIn the sample, b1=1, c1=4, b2=4, c2=4, b3=4, c3=2, b4=3, c4=9, b5=9, c5=9, so b1 * c1 + b2 * c2 + … + b5 * c5 = 136.
Author
SYSU
Source
2014 Multi-University Training Contest 9
Recommend
f[i]是a[i]左边最近的倍数的下标,g[i]是a[i]右边最近的倍数的下标。
用h[k],记录k的倍数上次出现的位置。求f[i]时,从左往右扫,扫到a[i]时,f[i]=h[a[i]],并且枚举出a[i]所有约数j,更新h[j]=h[a[i]/j]=i.因为枚举约数复杂度为O(sqrt(n)),对于10^5的数据,O(n*sqrt(n))能在规定时间内完成。
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define maxn 100001
int f[maxn],g[maxn],a[maxn];
int h[maxn];
int main()
{
int n;
while(~scanf("%d", &n) && n){
for(int i = 1; i <= n; i++)
scanf("%d", a+i);
memset(h, 0, sizeof(h));
for(int i = 1; i <= n; i++){
f[i] = h[a[i]]? h[a[i]]:i;
for(int j = 1; j*j <= a[i]; j++)
if(a[i]%j == 0){
h[a[i]/j] = h[j] = i;
}
}
memset(h,0,sizeof(h));
for(int i = n; i > 0; i--){
g[i] = h[a[i]]?h[a[i]]:i;
for(int j = 1; j*j <= a[i]; j++)
if(a[i]%j == 0){
h[a[i]/j]=h[j] = i;
}
}
long long ans = 0;
for(int i =1; i <= n; i++)
ans += (long long)a[f[i]]*a[g[i]];
printf("%I64d\n", ans);
}
return 0;
}
相关文章推荐
- HDU 5812 Distance(求约数+枚举gcd)
- HDU 4961 Boring Sum(哈希标记,暴力枚举)
- HDU 5752 Sqrt Bo【枚举,大水题】
- HDU 2489 Minimal Ratio Tree(枚举组合+最小生成树)
- HDU 1598 find the most comfortable road(枚举+并查集,类似于最小生成树)
- HDU 2489 Minimal Ratio Tree(dfs枚举+最小生成树)
- hdu 4454, 离散化,枚举
- hdu 5143 暴力枚举,转换的思想
- 【数论】【最大公约数】【枚举约数】CODEVS 1012 最大公约数和最小公倍数问题 2001年NOIP全国联赛普及组
- HDU 6015 Skip the Class (枚举)
- HDU 1492 The number of divisors(约数) about Humble Numbers(数学题)
- hdu 4282 枚举,非二分
- hdu The Frog's Games(二分枚举)
- HDU 1281 棋盘游戏 (二分图+枚举每点是否为匹配关键)
- HDU 3484 Matrix Game 枚举暴力
- 多校7 HDU-6127 Hard challenge 几何数学,枚举极角
- HDU 2363 Cycling 【暴力枚举 + 最短路】
- hdu4430之枚举+二分
- hdu 4770 Lights Against Dudely(暴力枚举dfs)
- HDU 1431 素数回文-暴力枚举