看了你的分享http://openinx.github.io/2013/01/01/plane-sweep-thinking/ #1

Open

opened

on Aug 25, 2020

针对经典问题C，在这个问题基础上如果需要求出N个矩形中相交的最大次数以及点的个数，有什么思路吗?谢谢

Metadata

Assignees

No one assigned

Labels

No labels

No labels

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests