Codeforces #Round 376 F 题解

F. Video Cards

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Vlad is fond of popular computer game Bota-2. Recently, the developers announced the new add-on named Bota-3. Of course, Vlad immediately bought only to find out his computer is too old for the new game and needs to be updated.

There are n video cards in the shop, the power of the i-th video card is equal to integer value ai. As Vlad wants to be sure the new game will work he wants to buy not one, but several video cards and unite their powers using the cutting-edge technology. To use this technology one of the cards is chosen as the leading one and other video cards are attached to it as secondary. For this new technology to work it's required that the power of each of the secondary video cards is divisible by the power of the leading video card. In order to achieve that the power of any secondary video card can be reduced to any integer value less or equal than the current power. However, the power of the leading video card should remain unchanged, i.e. it can't be reduced.

Vlad has an infinite amount of money so he can buy any set of video cards. Help him determine which video cards he should buy such that after picking the leading video card and may be reducing some powers of others to make them work together he will get the maximum total value of video power.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of video cards in the shop.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 200 000) — powers of video cards.

Output

The only line of the output should contain one integer value — the maximum possible total power of video cards working together.

Examples

input

4
3 2 15 9

output

27

input

4
8 2 2 7

output

18

Note

In the first sample, it would be optimal to buy video cards with powers 3, 15 and 9. The video card with power 3 should be chosen as the leading one and all other video cards will be compatible with it. Thus, the total power would be 3 + 15 + 9 = 27. If he buys all the video cards and pick the one with the power 2 as the leading, the powers of all other video cards should be reduced by 1, thus the total power would be 2 + 2 + 14 + 8 = 26, that is less than 27. Please note, that it's not allowed to reduce the power of the leading video card, i.e. one can't get the total power 3 + 1 + 15 + 9 = 28.

In the second sample, the optimal answer is to buy all video cards and pick the one with the power 2 as the leading. The video card with the power 7 needs it power to be reduced down to 6. The total power would be 8 + 2 + 2 + 6 = 18.

————————————分割线————————————

分析：

枚举每个数字，让它成为主视频卡a_k，然后枚举倍数 j ，将j介于 ( j - 1 ) * a_k<= x < j * a_k , 全部减少到 ( j - 1 ) * a_k，为了快速的找到这些数，可以使用前缀和优化思想。

例如：

a₁为现在的主视频卡，让介于[ a₁ * 1 , a₁ * 2 ) 减少到a1 , 让介于[ a₁ * 2 , a₁ * 3 ) 减少到2 * a₁ , 依此类推... ...

#include "bits/stdc++.h"

using namespace std ;
const int maxN = 3e5 + 1e3 ; 
const int INF = 2147483647 ; 
typedef long long QAQ ;

QAQ Sum[ maxN ] , buc[ maxN ] ;

inline int INPUT ( ) {
        int x = 0 , f = 1 ; char ch = getchar ( ) ;
        while ( ch < '0' || '9' < ch ) { if ( ch == '-' ) f = -1 ; ch = getchar ( ) ; } 
        while ( '0' <= ch && ch <= '9' ) { x = ( x << 1 ) + ( x << 3 ) + ch - '0' ; ch = getchar ( ) ; }
        return x * f ; 
}

void Pre_Init ( int n ) {
        for ( int i=1 ; i<=_max ; ++i ) 
                Sum[ i ] = Sum[ i - 1 ] + buc[ i ] ;
}

inline QAQ gmax ( QAQ x , QAQ y ) { return x > y ? x : y ; } 
inline QAQ gmin ( QAQ x , QAQ y ) { return x > y ? y : x ; }

int main ( ) {
        QAQ Ans = -INF , _max = -INF ; 
        int N = INPUT ( ) ; 
        for ( int i=1 ; i<=N ; ++i ) {
                int tmp = INPUT ( ) ; 
                ++ buc [ tmp ] ;
                _max  = gmax ( _max , tmp ) ;
        }
        
        Pre_Init ( _max ) ; 
        
        for ( int i=1 ; i<=_max ; ++i ) {
                if ( !buc[ i ] ) continue ;
                QAQ rest = 0 ;
                for ( int j=i ; j<=_max ; j+=i ) {
                        rest += ( Sum[ gmin ( i + j - 1 , _max ) ] - Sum [ j - 1 ] ) * j ;
                }
                Ans = gmax ( Ans , rest ) ;
        }
        cout << Ans << endl ; 
        return 0 ; 
}

 

2016-10-18 10:45:39

(完)