![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
扫描线
newhonor
可以不伟大,但不能卑微
展开
-
P5490 【模板】扫描线
https://www.luogu.org/problem/P5490总结:要左开右闭,不然节点中间空出来的就不会计算了;所以计算时用y[pos+1];#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algori...原创 2019-08-18 16:08:07 · 124 阅读 · 0 评论 -
Atlantis POJ - 1151
https://cn.vjudge.net/problem/POJ-1151#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include ...原创 2019-08-18 16:33:37 · 196 阅读 · 0 评论 -
C - 覆盖的面积 HDU - 1255
https://cn.vjudge.net/contest/303187#problem/C总结: 覆盖一次,sum2是至少覆盖两次;因为时区间修改,并不是单点修改所以当前覆盖两次的是当前区间的子区间又覆盖过一次; else if(tree[rt].cover==1)tree[rt].len2=tree[lson].len1+tree[rson].len1;#include &l...原创 2019-08-18 17:26:56 · 118 阅读 · 0 评论 -
2018 ICPC Pacific Northwest Regional Contest Problem F Rectangles
http://codeforces.com/gym/101982/attachments思路:只有将区间最大长度减更改的长度即可;就是异或了;注意:异或不是出入边标志;而是1就行;#include <iostream>#include <cstring>#include <queue>#include <vector>#in...原创 2019-08-18 20:49:02 · 225 阅读 · 0 评论 -
On the way to the park Gym - 101147I
https://cn.vjudge.net/problem/Gym-101147I#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-21 11:10:00 · 297 阅读 · 0 评论