{"trustable":false,"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":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cdiv id\u003d\"problem-body\"\u003e \n \u003cp\u003eYou are given a sequence A of N (N \u0026lt;\u003d 50000) integers between -10000 and 10000. On this sequence you have to apply M (M \u0026lt;\u003d 50000) operations: \u003cbr\u003e modify the i-th element in the sequence or for given x y print max{Ai + Ai+1 + .. + Aj | x\u0026lt;\u003di\u0026lt;\u003dj\u0026lt;\u003dy }. \n\u003c/p\u003e \n求一个区间的最大连续和。\n \u003ch3\u003eInput\u003c/h3\u003e \n \u003cp\u003eThe first line of input contains an integer N. The following line contains N integers, representing the sequence A1..AN. \u003cbr\u003e The third line contains an integer M. The next M lines contain the operations in following form:\u003cbr\u003e 0 x y: modify Ax into y (|y|\u0026lt;\u003d10000).\u003cbr\u003e 1 x y: print max{Ai + Ai+1 + .. + Aj | x\u0026lt;\u003di\u0026lt;\u003dj\u0026lt;\u003dy }.\u003cbr\u003e \u003c/p\u003e \n 0表示把A[x]改成y\u003c/br\u003e\n1 表示求[x,y]这个区间的最大连续和。\n \u003ch3\u003eOutput\u003c/h3\u003e \n \u003cp\u003eFor each query, print an integer as the problem required. \u003c/p\u003e \n \u003ch3\u003eExample\u003c/h3\u003e \n \u003cpre\u003e\n\u003cb\u003eInput:\u003c/b\u003e\n4\n1 2 3 4\n4\n1 1 3\n0 3 -3\n1 2 4\n1 3 3\n\n\u003cb\u003eOutput:\u003c/b\u003e\n6\n4\n-3\n\u003c/pre\u003e \n \u003c/div\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}}]}