UVA 1398 - Meteor（排序+扫描方法+几何）(二)
; scanf("%d%d%d", &w, &h, &n); for (int i = 0; i < n; i++) { int x, y, xd, yd; scanf_(x); scanf_(y); scanf_(xd); scanf_(yd); l = 0, r = INF; g(x, xd, w); g(y, yd, h); if (l < r) { e[en].t = l; e[en++].flag = 1; e[en].t = r; e[en++].flag = -1; } } } int solve() { int ans = 0, num = 0; sort(e, e + en, cmp); for (int i = 0; i < en; i++) { num += e[i].flag; ans = max(ans, num); } return ans; } int main() { scanf("%d", &t); while (t--) { init(); printf("%d\n", solve()); } return 0; }