Where there is a will,there is a way.

题目线段树的单点更新，没什么好讲的…program poj_2823; const maxN = 2500000; type rec = record left,right,mark,value1,value2:longint; //value1为最大值 value2为最小值 end; var n,k,i,a:longint; tree:array[

题目线段树的区间更新Problem: 1823 Memory: 1644K Time: 2938MSprogram hotel; const maxN=16000*4; type rec = record left,right,value,lm,rm,mark:longint; end; //lm表示从左开始最多连续多少个，lr同理 var