package chap01; public class chap061 { private static int a=0,b=2,c=7,d=4,e=5; static int shuzu[]={b,a,e,d,c}; int max(int a,int b) { return a>b?a:b; } public static void main(String[] args) { // TODO 自动生成方法存根 chap061 cp=new chap061(); int x; for
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;
