{"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 tree with N (\u003cem\u003eN\u003c/em\u003e \u0026lt;\u003d 100000) nodes. Each node has a integer value x_i (\u003cem\u003e|x_i|\u003c/em\u003e \u0026lt;\u003d 10000).\u003c/p\u003e\r\n\u003cp\u003eYou have to apply Q (\u003cem\u003eQ\u003c/em\u003e \u0026lt;\u003d 100000) operations:\u003c/p\u003e\r\n\u003cul\u003e\r\n\u003cli\u003e\u003cem\u003e1 a b\u003c/em\u003e : answer the maximum contiguous sum (maybe empty, will always larger than or equal to 0)\u0026nbsp;from the path \u003cem\u003ea→b\u003c/em\u003e ( inclusive ).\u003c/li\u003e\r\n\u003cli\u003e\u003cem\u003e2 a b c\u003c/em\u003e : change all value in the path \u003cem\u003ea→b\u003c/em\u003e ( inclusive ) to \u003cem\u003ec\u003c/em\u003e. (\u003cem\u003e|c|\u003c/em\u003e \u0026lt;\u003d 10000)\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003ch3\u003eInput\u003c/h3\u003e\r\n\u003cp\u003efirst line consists one integer N.\u003c/p\u003e\r\n\u003cp\u003enext line consists N integer x_i.\u003c/p\u003e\r\n\u003cp\u003enext N-1 line, each consists two integer u, v, means that node u and node v are connected\u003c/p\u003e\r\n\u003cp\u003enext line consists 1 integer Q.\u003c/p\u003e\r\n\u003cp\u003enext Q line : \u003cem\u003e1 a b \u003c/em\u003eor \u003cem\u003e2 a b c\u003c/em\u003e .\u003c/p\u003e\r\n\u003ch3\u003eOutput\u003c/h3\u003e\r\n\u003cp\u003eFor each query, output one line the maximum contiguous sum.\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\r\n-3 -2 1 2 3\r\n1 2\r\n2 3\r\n1 4\r\n4 5\r\n3\r\n1 2 5\r\n2 3 4 2\r\n1 2 5\r\n\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e5\r\n9\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"}}]}