hdu 4961

最新推荐文章于 2015-06-09 23:00:41 发布

柠檬与茉莉

最新推荐文章于 2015-06-09 23:00:41 发布

阅读量829

点赞数

分类专栏：模拟文章标签： acm 遍历

本文链接：https://blog.csdn.net/liusuangeng/article/details/38710257

版权

模拟专栏收录该内容

10 篇文章 0 订阅

订阅专栏

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4961

Boring Sum

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 610 Accepted Submission(s): 301

Problem Description

Number theory is interesting, while this problem is boring.

Here is the problem. Given an integer sequence a ₁, a ₂, …, a _n, let S(i) = {j|1<=j<i, and a _j is a multiple of a _i}. 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 a _f(i). Similarly, let T(i) = {j|i<j<=n, and a _j is a multiple of a _i}. If T(i) is not empty, let g(i) be the minimum integer in T(i); otherwise, g(i) = i. Now we define c _i as a _g(i). The boring sum of this sequence is defined as b ₁ * c ₁ + b ₂ * c ₂ + … + b _n * c _n.

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 a ₁, a ₂, …, a _n (1<= a _i<=100000).

The input is terminated by n = 0.

Output

Output the answer in a line.

Sample Input

Sample Output

  
  
   
   136


   
   
    
    
     
     Hint
    
    In 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

思路：（1）如果这道题用O(n^2)来解，那么肯定会超时~

（2）只能用一种时间复杂度介于O(n)和O（n^2）之间的算法；先从左向右遍历一遍，每出现一个数，就用一个数组cnt[a[i]]来记录这个数a[i]的下标~求b[]

然后再反着遍历一遍，也用cnt[a[i]]来记录数a[i]出现的下标，求c[]

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <cmath>
#include <cstdio>
const int maxn=101000;
using namespace std;
int a[maxn];
int b[maxn];
int c[maxn];

int f[maxn];
int cnt[maxn];

int main()
{
 int n;
 while(scanf("%d",&n)!=EOF&&n)
 {
  for(int i=1;i<=n;i++)scanf("%d",&a[i]);
  memset(cnt,-1,sizeof(cnt));
  for(int i=1;i<=n;i++)
  {
    if(i==1)f[i]=i;
    else
       {
        f[i]=-1;
        for(int j=a[i];j<maxn;j+=a[i])
          if(cnt[j]!=-1)f[i]=max(f[i],cnt[j]);
        if(f[i]==-1)f[i]=i;
       }
    cnt[a[i]]=i;
  }
  for(int i=1;i<=n;i++)
  {
    b[i]=a[f[i]];
  }

  memset(cnt,-1,sizeof(cnt));
  for(int i=n;i>=1;i--)
  {
   if(i==n)f[i]=i;
   else
   {
     f[i]=99999999;
     for(int j=a[i];j<maxn;j+=a[i])
      if(cnt[j]!=-1)f[i]=min(f[i],cnt[j]);
     if(f[i]==99999999)f[i]=i;
   }
   cnt[a[i]]=i;
  }
  for(int i=1;i<=n;i++)
  {
    c[i]=a[f[i]];
  }
  long long ct=0;
  for(int i=1;i<=n;i++)
    ct+=(long long )b[i]*c[i];
  printf("%I64d\n",ct);
 }
 return 0;
}