#include<iostream> #include<algorithm> #include<vector> using namespace std; int n; int l,r; typedef pair<int,int>PII; vector<PII>ses; void m(vector<PII>&segs){ vector<PII>res; int st=-2e9; int ed=-2e9; for(auto se:segs){ if(ed<se.first){ if(st!=-2e9){res.push_back({st,ed});} st=se.first;ed=se.second; } else ed=max(ed,se.second); } res.push_back(st,ed); ses=res; } int main(){ cin>>n; for(int i=0;i<n;i++){ cin>>l>>r; ses.push_back({l.r}) } sort(ses.begin(),ses.end()); m(ses); cout<<ses.size(); return 0; }
标签:2e9,ses,int,ed,合并,segs,803,include,Acwing From: https://www.cnblogs.com/ljq20204136/p/16840016.html