Problem:
Score: 500 points

Problem Statement

Given is a permutation P of \{1, 2, \ldots, N\}.

For a pair (L, R) (1 \le L \lt R \le N), let X_{L, R} be the second largest value among P_L, P_{L+1}, \ldots, P_R.

Find \displaystyle \sum_{L=1}^{N-1} \sum_{R=L+1}^{N} X_{L,R}.

Constraints

2 \le N \le 10^5

1 \le P_i \le N

P_i \neq P_j (i \neq j)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
P_1 P_2 \ldots P_N

Output

Print \displaystyle \sum_{L=1}^{N-1} \sum_{R=L+1}^{N} X_{L,R}.

Sample Input 1

3
2 3 1

Sample Output 1

5

X_{1, 2} = 2, X_{1, 3} = 2, and X_{2, 3} = 1, so the sum is 2 + 2 + 1 = 5.

Sample Input 2

5
1 2 3 4 5

Sample Output 2

30

Sample Input 3

8
8 2 7 3 4 5 6 1

Sample Output 3

136

Solution in Go (1.6) (judge verdict: Wrong Answer)

package main

import (
    "bufio"
    "fmt"
    "os"
    "strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func nextInt() int {
    sc.Scan()
    i, e := strconv.Atoi(sc.Text())
    if e != nil {
        panic(e)
    }
    return i
}

func _rightsearch(num int, len int, start int) int {
    if start < 0 || start > len + 1 {
        return -1
    }
    for i := start; i < start + 10 && i <= len; i++ {
        if p[i] > num {
            return i
        }
    }
    return -1
}

func rightsearch(num int, len int, start int) int {
    right := _rightsearch(num, len, start)
        if right == -1 {
            for j:= revp[num] / 10 + 1; j < len / 10; j++ {
                if used_deci[j] == true {
                    right = _rightsearch(num, len, j * 10)
                    break
                }
            }
        }
    return right
}

func _leftsearch(num int, len int, start int) int {
    if start < 0 || start > len + 1 {
        return -1
    }
    for i := start; i > start - 10 && i >= 0; i-- {
        if p[i] > num {
            return i
        }
    }
    return -1
}

func leftsearch(num int, len int, start int) int {
    left := _leftsearch(num, len, start)
        if left == -1 {
            for j:= revp[num] / 10; j >= 0; j-- {
                if used_deci[j] == true {
                    left = _leftsearch(num, len, j * 10)
                    break
                }
            }
        }
    return left
}

var p, revp []int
var used_deci []bool

func main() {
    sc.Split(bufio.ScanWords)
	n := nextInt()
    p = make([]int, n + 1, n + 1)
    revp = make([]int, n + 1, n + 1)
    used_deci = make([]bool, n/10 + 1, n/10 + 1)

    for i := 1; i <= n; i++ {
        p[i] = nextInt()
        revp[p[i]] = i
    }

    // 最大値にusedを付ける
    used_deci[n/10] = true

    score := 0
    for i := n - 1; i >= 1; i-- {
        pos := revp[i]

        // 右サーチ
        right := rightsearch(i, n, pos + 1)
        rightright := -1 
        if right != -1 {
            rightright = rightsearch(i, n, right + 1)
        }

        if right == -1 {
            right = n + 1
        }
        if rightright == -1 {
            rightright = n + 1
        }

        // 左サーチ
        left := leftsearch(i, n, pos - 1)
        leftleft := -1
        if left != -1 {
            leftleft = leftsearch(i, n, left - 1)
        }

        if left == -1 {
            left = 0
        }
        if leftleft == -1 {
            leftleft = 0
        }
        
        //fmt.Println("i : ", i, ", pos : ", pos, ", left : ", left, ", leftleft : ", leftleft, ", right : ", right, ", rightright : ", rightright)

        if right != n + 1 {
            
            // 右スコア加算
            //fmt.Println("右スコア加算 : ", i,",",i * ((pos - left) * (rightright - right)))
            score += i * ((pos - left) * (rightright - right))
        }
        if left != -1 {
            // 左スコア加算
            //fmt.Println("左スコア加算 : ", i,",",i * ((left - leftleft) * (right - pos)))
            score += i * ((left - leftleft) * (right - pos))
        }
        used_deci[i/10] = true
    }


    fmt.Println(score)
}