SolarDomo的博客

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1542 题意：裸的求长方形的并代码：#include <bits/stdc++.h>#define sf scanf#define pf printfusing namespace std;const int maxn = 100 + 5;const int TOT_SEG = maxn * 2

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1828代码：#include <bits/stdc++.h>#define sf scanf#define pf printfusing namespace std;const int maxn = 5000 + 5;const int max_seg = maxn * 2;/** SEG */

测试题目：HDU 1542using namespace std;const int maxn = 100 + 5;const int TOT_SEG = maxn * 2;/** Seg** l,r,h 分别为线段的左端点，右端点，高** f 标识上下边*/struct Seg{ int f; double l,r,h; void set(double l