## Arithmetic Snowman

View as PDF

Points: 7 (partial)
Time limit: 1.4s
Memory limit: 64M

Author:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

k_53P loves to build snowmen. But his favorite type has to be arithmetic snowmen. An arithmetic snowman consists of 3 snowballs whose sizes, when arranged in a non-decreasing order, form an arithmetic sequence. For example, k_53P can make an arithmetic snowman out of snowballs of sizes 1, 3, and 5.

The size of an arithmetic snowman is the sum of the sizes of the snowballs that it's made of. k_53P has made snowballs of varying sizes, find the largest arithmetic snowman he can make!

#### Input Specification

The first line of input will contain , the number of snowballs.

The second line of input will contain space-separated integers, the sizes of the snowballs.

#### Output Specification

One integer, the size of the largest arithmetic snowman k_53P can build. It is guaranteed that he can build at least one.

#### Sample Input

7
4 2 8 10 14 3 7

#### Sample Output

24

#### Explanation for Sample Output

k_53P will use the snowballs of sizes 2, 8 and 14 to make the snowman.

• commented on Jan. 2, 2016, 10:08 p.m.

for example when there is only one or two number entered; or there are only a few numbers and they don't form an arithmetic sequence anyhow

• commented on Jan. 2, 2016, 10:16 p.m.

It is guaranteed that he can build at least one, the statement has been updated, sorry for the confusion.

• commented on Jan. 1, 2016, 1:58 p.m.

It says:

k_53P has made N snowballs of varying sizes

But i think the sizes are repeated in batch #1

• commented on Jan. 1, 2016, 1:59 p.m.

Varying sizes does not imply that all sizes are distinct, sorry for the confusion.