hdu 4961 Boring Sum--2014 Multi-University Training Contest 9

最新推荐文章于 2020-08-11 21:11:04 发布

东南枝DP

最新推荐文章于 2020-08-11 21:11:04 发布

阅读量584

点赞数

分类专栏：算法 C++ 文章标签： 2014 Multi-Universit 算法 acm

本文链接：https://blog.csdn.net/asdfghjkl1993/article/details/38686287

版权

算法同时被 2 个专栏收录

115 篇文章 0 订阅

订阅专栏

C++

79 篇文章 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): 95 Accepted Submission(s): 49

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.

Source

2014 Multi-University Training Contest 9

Recommend

hujie | We have carefully selected several similar problems for you: 4969 4967 4966 4964 4963

Statistic | Submit | Discuss | Note

#include <stdio.h>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdlib>
#define CLR(A) memset(A,0,sizeof(A))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a,b) ((a)>=0?(a):(-a))
using namespace std;
vector<set<int> > VEC(100100);
int data[100100],b[100100],c[100100],datar[100100];
int main()
{
    int n;
    while(scanf("%d", &n),n)
    {
        memset(b,0,sizeof(b));
        memset(c,0,sizeof(c));
        for(int i=0;i<=100000;i++)
            VEC[i].clear();
        for(int i=1;i<=n;i++){
            scanf("%d",&data[i]);
            VEC[data[i]].insert(i);
            b[i]=data[i];
            c[i]=data[i];
        }
        for(int i=1;i<=n;i++){
            if(b[i]==1 && i-1>0)    b[i]=data[i-1];
            if(c[i]==1 && i+1<=n)   c[i]=data[i+1];
        }
        for(int i=1;i<=n;i++){
            for(int j=2;j*j<=data[i];j++){
                if(data[i]%j==0){
                    int tmp=j,id;
                    if(VEC[tmp].size()!=0){
                        id=*(VEC[tmp].lower_bound(i));
                        if(VEC[tmp].lower_bound(i)!=VEC[tmp].end())
                            b[id]=data[i];
                    }
                    tmp=data[i]/j;
                    if(VEC[tmp].size()!=0){
                        id=*(VEC[tmp].lower_bound(i));
                        if(VEC[tmp].lower_bound(i)!=VEC[tmp].end())
                            b[id]=data[i];
                    }
                }
            }
        }

        for(int i=n;i>=1;i--){
            for(int j=2;j*j<=data[i];j++){
                if(data[i]%j==0){
                    int tmp=j,id;
                    set<int>::iterator p;
                    if(VEC[tmp].size()!=0){
                        p=VEC[tmp].upper_bound(i);
                        if(p!=VEC[tmp].begin()){
                            p--;id=*p;
                            c[id]=data[i];
                        }
                    }
                    tmp=data[i]/j;
                    if(VEC[tmp].size()!=0){
                        p=VEC[tmp].upper_bound(i);
                        if(p!=VEC[tmp].begin()){
                            p--;id=*p;
                            c[id]=data[i];
                        }
                    }
                }
            }
        }
        long long ans=0;
        for(int i=1;i<=n;i++){
            ans+=((long long)b[i])*((long long)c[i]);
        }
        cout<<ans<<endl;
    }
    return 0;
}