API Response (JSON)
{
"problem": {
"name": "Index × A(Not Continuous ver.)",
"description": {
"content": "You are given an integer sequence $A=(A_1,A_2,\\dots,A_N)$ of length $N$. Find the maximum value of $\\displaystyle \\sum_{i=1}^{M} i \\times B_i$ for a (not necessarily contiguous) subsequence $B=(B_1,B_",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc267_d"
},
"statements": [
{
"statement_type": "Markdown",
"content": "You are given an integer sequence $A=(A_1,A_2,\\dots,A_N)$ of length $N$.\nFind the maximum value of $\\displaystyle \\sum_{i=1}^{M} i \\times B_i$ for a (not necessarily contiguous) subsequence $B=(B_1,B_...",
"is_translate": false,
"language": "English"
}
]
}