摘要: 线段树模板(以求和为例)单点更新,区间查询program stree1;var dat:array[0..400000]of longint; n,i,m,len,x,y,v:longint;function min(x,y:longint):longint;begin if xy then ... 阅读全文
posted @ 2015-07-14 16:17 QTY_YTQ 阅读(225) 评论(0) 推荐(0)