API Response (JSON)
{
"problem": {
"name": "[DTCPC 2024] mex,min,max",
"description": {
"content": "给定序列 $\\{a_n\\}$ 和 $k$，求有多少子区间 $[l,r]$ 满足 $\\operatorname{mex}\\{a_l,a_{l+1},\\dots,a_{r-1},a_r\\}+\\min\\{a_l,a_{l+1},\\dots,a_{r-1},a_r\\}+k\\geq \\max\\{a_l,a_{l+1},\\dots,a_{r-1},a_r\\}$。 $\\operatorname{mex}$ 定",
"description_type": "Markdown"
},
"platform": "Luogu",
"limit": {
"time_limit": 1500,
"memory_limit": 524288
},
"difficulty": {
"LuoguStyle": "P6"
},
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "LGP10169"
},
"statements": [
{
"statement_type": "Markdown",
"content": "给定序列 $\\{a_n\\}$ 和 $k$，求有多少子区间 $[l,r]$ 满足 $\\operatorname{mex}\\{a_l,a_{l+1},\\dots,a_{r-1},a_r\\}+\\min\\{a_l,a_{l+1},\\dots,a_{r-1},a_r\\}+k\\geq \\max\\{a_l,a_{l+1},\\dots,a_{r-1},a_r\\}$。\n\n$\\operatorname{mex}$ 定...",
"is_translate": false,
"language": "English"
}
]
}