摘要: 贪心区间覆盖 算法分析 #include<iostream> #include<algorithm> using namespace std; const int N = 100010; int n; struct Range { int l, r; bool operator< (const Ra 阅读全文
posted @ 2024-01-08 21:59 TomLove 阅读(21) 评论(0) 推荐(0)
摘要: 贪心区间分组 #include<iostream> #include<algorithm> #include<queue> using namespace std; const int N = 100010; int n; struct Range{ int l, r; bool operator< 阅读全文
posted @ 2024-01-08 17:02 TomLove 阅读(25) 评论(0) 推荐(0)