hdu_4391,线段树
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=4391不想我说了,调了好久不会这。。#include<cstdio>#include<cstring>const int maxn(111111);#define lson l, m, rt<<1#define rson m+1, r, rt<<1|1#define ll rt<<1#define rr rt<<1|1int max[maxn<<2], min[maxn<<2], sum[maxn<<2 阅读全文
posted @ 2012-08-24 15:46 louzhang_swk 阅读(372) 评论(0) 推荐(1) 编辑