我是谁 --- 卡比兽

AtlantisTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8998    Accepted Submission(s): 3856Problem DescriptionThere are several ancient Greek t...

看了若干神牛的文章 对线段树的扫描线总算入门了求面积就是离散化坐标 从下往上离散横坐标 水平扫描离散纵坐标 从下往上为例 下边定义值为1 上边定义值为-1在扫的过程中就能通过更新操作得到底边长 用高度差相乘就是面积其实还是比较好实现的 板子代码using namespace std; #define lson l , m , rt << 1 #define rson m...

简单的线段树加扫描线离散化板子题#include <cstdio> #include <iostream> #include <cstring> #include <cmath> #include <algorithm> using namespace std; #define lson l , m , rt << 1 #de...

以前以为胡浩大神的点树我改成区间树 结果这题最后一个数据竟然爆了以后还是老老实实用点树把这饭真香#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define lson l , m , rt <&...

Quoit DesignTime Limit: 5 Seconds      Memory Limit: 32768 KBHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled award...