{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n\t\u003cp\u003eGiven a sequence A of N \u003cem\u003e(N \u0026lt;\u003d 100000)\u003c/em\u003e integers, you have to apply Q \u003cem\u003e(Q \u0026lt;\u003d 100000)\u003c/em\u003e operations:\u003cbr\u003e\u003cbr\u003eInsert, delete, replace an element, find the maximum contiguous(non empty) sum in a given interval.\u003c/p\u003e\r\n\u003ch3\u003eInput\u003c/h3\u003e\r\n\u003cp\u003eThe first line of the input contains an integer N.\u003cbr\u003eThe following line contains N integers, representing the starting\u003cbr\u003esequence A1..AN, \u003cem\u003e(|Ai| \u0026lt;\u003d 10000)\u003c/em\u003e.\u003cbr\u003e\u003cbr\u003eThe third line contains an integer Q. The next Q lines contains the operations in following form:\u003cbr\u003e\u003cbr\u003e\u003cstrong\u003eI x y\u003c/strong\u003e: insert element y at position x \u003cem\u003e(between x - 1 and x)\u003c/em\u003e.\u003cbr\u003e\u003cstrong\u003eD x\u003c/strong\u003e\u0026nbsp; : delete the element at position x.\u003cbr\u003e\u003cstrong\u003eR x y\u003c/strong\u003e: replace element at position x with y.\u003cbr\u003e\u003cstrong\u003eQ x y\u003c/strong\u003e: print max{Ai + Ai+1 + .. + Aj | x \u0026lt;\u003d i \u0026lt;\u003d j \u0026lt;\u003d y}.\u003cbr\u003e\u003cbr\u003eAll given positions are valid, and given values are between -10000 and +10000.\u003cbr\u003e\u003cbr\u003eThe sequence will never be empty.\u003c/p\u003e\r\n\u003ch3\u003eOutput\u003c/h3\u003e\r\n\u003cp\u003eFor each \u003cstrong\u003e\"Q\"\u003c/strong\u003e operation, print an integer(one per line) as described above.\u003c/p\u003e\r\n\u003ch3\u003eExample\u003c/h3\u003e\r\n\u003cdiv\u003e\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\n3 -4 3 -1 6\n10\nI 6 2\nQ 3 5\nR 5 -4\nQ 3 5\nD 2\nQ 1 5\nI 2 -10\nQ 1 6\nR 2 -1\nQ 1 6\n\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e8\n3\n6\n3\n5\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e\n\u003c/div\u003e"}}]}