线段树总结
摘要：
模板： 点修改： 1 int sum[maxn<<2], maxv[maxn<<2], minv[maxn<<2]; 2 3 void maintain(int u) 4 { 5 int lc = u*2, rc = u*2+1; 6 sum[u] = sum[lc] + sum[rc]; 7 ma 阅读全文
posted @ 2017-10-29 17:13 h_z_cong 阅读(279) 评论(0) 推荐(0) 编辑
HDU3642 Get The Treasury —— 求矩形交体积 线段树 + 扫描线 + 离散化
摘要：
题目链接：https://vjudge.net/problem/HDU-3642 Jack knows that there is a great underground treasury in a secret region. And he has a special device that ca 阅读全文
posted @ 2017-10-29 10:46 h_z_cong 阅读(205) 评论(0) 推荐(0) 编辑
