{"problem":{"name":"Second Sum","description":{"content":"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=","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc140_e"},"statements":[{"statement_type":"Markdown","content":"Given is a permutation $P$ of ${1, 2, \\ldots, N}$.\nFor 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$.\nFind $\\displaystyle \\sum_{L=1}^{N-1} \\sum_{R=L+1}^{N} X_{L,R}$.\n\n## Constraints\n\n*   $2 \\le N \\le 10^5$\n*   $1 \\le P_i \\le N$\n*   $P_i \\neq P_j $ $(i \\neq j)$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$P_1$ $P_2$ $\\ldots$ $P_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc140_e","tags":[],"sample_group":[["3\n2 3 1","5\n\n$X_{1, 2} = 2, X_{1, 3} = 2$, and $X_{2, 3} = 1$, so the sum is $2 + 2 + 1 = 5$."],["5\n1 2 3 4 5","30"],["8\n8 2 7 3 4 5 6 1","136"]],"created_at":"2026-03-03 11:01:14"}}