## Frog 3

View as PDF

Points: 20
Time limit: 1.0s
Memory limit: 256M

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

These problems are from the atcoder DP contest, and were transferred onto DMOJ. All problem statements were made by several atcoder users. As there is no access to the test data, all data is randomly generated. If there are issues with the statement or data, please contact Ninjaclasher on slack.

There are stones, numbered . For each , the height of Stone is . Here, holds.

There is a frog who is initially at Stone . He will repeat the following action some number of times to reach Stone :

• If the frog is currently on Stone , jump to one of the following stones: Stone . Here, a cost of is incurred, where is the stone to land on.

Find the minimum possible total cost incurred before the frog reaches Stone .

#### Constraints

• All values in input are integers.

#### Input Specification

The first line will contain two integers .

The second line will contain integers, .

#### Output Specification

Print the minimum possible total cost incurred.

#### Sample Input 1

5 6
1 2 3 4 5

#### Sample Output 1

20

#### Explanation For Sample 1

If we follow the path , the total cost incurred would be .

#### Sample Input 2

2 1000000000000
500000 1000000

#### Sample Output 2

1250000000000

#### Explanation For Sample 2

The answer may not fit into a 32-bit integer type.

#### Sample Input 3

8 5
1 3 4 5 10 11 12 13

#### Sample Output 3

62

#### Explanation For Sample 3

If we follow the path , the total cost incurred would be .