hdu 4961 Boring Sum

Boring Sum

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

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

  
  

   
   5
1 4 2 3 9
0
  
  

 

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

 

题解及代码：

#include <cstdio>
#include <iostream>
#include <vector>
#define maxn 100010
using namespace std;
typedef long long ll;

struct node
{
    int vis;
    vector<int>pos;
}s[maxn];
int v[maxn];
struct dir
{
    int l,r;
}pos[maxn];

int main()
{
    int n;
    while(scanf("%d",&n)&&n)
    {
        for(int i=0;i<maxn;i++)
        if(s[i].vis)
        {
            s[i].vis=0;
            s[i].pos.clear();
        }

        for(int i=0;i<n;i++)
        {
            scanf("%d",&v[i]);
            s[v[i]].vis=1;
            s[v[i]].pos.push_back(i);
        }

        for(int i=0;i<n;i++)
        {
            int lpos=-1,rpos=10000000,t;
            for(int j=v[i];j<=100000;j+=v[i])
            if(s[j].vis)
            {
                for(int k=0;k<s[j].pos.size();k++)
                {
                    t=s[j].pos[k];
                    if(t<i&&lpos<t)
                        lpos=t;
                    if(t>i&&rpos>t)
                        rpos=t;
                }
            }
            if(lpos!=-1)
                pos[i].l=lpos;
            else
                pos[i].l=i;
            if(rpos!=10000000)
                pos[i].r=rpos;
            else
                pos[i].r=i;
        }
        ll ans=0;
        for(int i=0;i<n;i++)
        {
            ans+=(ll)v[pos[i].l]*v[pos[i].r];
        }
        printf("%I64d\n",ans);
    }
    return 0;
}
/*
我们记录每个数字出现的位置，然后从左向右扫描每个数字的倍数，
查找到合适的匹配位置就可以了。
*/