c题链接:https://ac.nowcoder.com/acm/contest/901/C 使用贪心算法,对区间进行排序,以末尾节点递增排序 #include<iostream> #include<algorithm> using namespace std; struct loc{ int first; int last; }; const int MAX=1000008; loc area[MAX]; bool com(loc a,loc b) { if(a.last<b.last) return tr...