帮助准备参加NOIP的学生解决许多问题 对于一些算法，进行了概括性，针对性的总结

writeln(max); end. 7. 线段树 type node=record p,r,m:longint; //[p,r) m = (p+r) div 2 k:longint; left,right:longint; end; var a:array[0..1000000] of node; data:array[0..1000000] of longint; i,j,n,m,tot,x,y,p,c:longint; function min(a,b:longint):longint;