{"problem":{"name":"Max Min","description":{"content":"We have a number sequence $A = (A_1, A_2, \\dots, A_N)$ of length $N$ and integers $X$ and $Y$. Find the number of pairs of integers $(L, R)$ satisfying all the conditions below. *   $1 \\leq L \\leq R ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc247_e"},"statements":[{"statement_type":"Markdown","content":"We have a number sequence $A = (A_1, A_2, \\dots, A_N)$ of length $N$ and integers $X$ and $Y$. Find the number of pairs of integers $(L, R)$ satisfying all the conditions below.\n\n*   $1 \\leq L \\leq R \\leq N$\n*   The maximum value of $A_L, A_{L+1}, \\dots, A_R$ is $X$, and the minimum is $Y$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq 2 \\times 10^5$\n*   $1 \\leq Y \\leq X \\leq 2 \\times 10^5$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $X$ $Y$\n$A_1$ $A_2$ $\\dots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc247_e","tags":[],"sample_group":[["4 3 1\n1 2 3 1","4\n\n$4$ pairs satisfy the conditions: $(L,R)=(1,3),(1,4),(2,4),(3,4)$."],["5 2 1\n1 3 2 4 1","0\n\nNo pair $(L,R)$ satisfies the condition."],["5 1 1\n1 1 1 1 1","15\n\nIt may hold that $X=Y$."],["10 8 1\n2 7 1 8 2 8 1 8 2 8","36"]],"created_at":"2026-03-03 11:01:13"}}