algorithm
未读线段树,支持单点修改,区间查询
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102import java.util.*;import java.io.*;//线段树(单点修改,区间查询)public class Main { static int a[]; public static void main(String args[]) { a=new int[N]; for(int i=1;i<=100;i++) { a[i]=i; } build(1,1,100);//建树区间1-100 out.println(query(1,1,100));//区间1-100的sum和 out.fl ...


