AcWing 803. 区间合并

 1 #include  2 #include  3 #include 
 4 
 5 using namespace std;
 6 
 7 int T;
 8 const int N= 100100;
 9 vectorint,int>> vp(N,pairint,int>(-1,-1));
10 
11 int Merge(int i,int j)
12 {
13     int s1 = vp[i].first;
14     int e1 = vp[i].second;
15 
16     int s2 = vp[j].first;
17     int e2 = vp[j].second;
18 
19     int merges = 0;int mergee= 0;
20 
21     if( (s1>= s2 && s1=s1 && s2  e1)  ){
22         merges = min(s1,s2);
23         mergee = max(e1,e2);
24 
25         vp[j].first = merges;
26         vp[j].second = mergee;
27         return 1;
28     }
29 
30     return 0;
31 }
32 
33 
34 int main()
35 {
36     cin >> T;
37 
38     for(int i =1 ;i ){
39         cin >> vp[i].first;  cin >> vp[i].second;             
40     }
41     int mergeCount =0;
42     for(int i =1 ; i ){
43         for(int j = i+1;j){
44             //比较 i j
45             int res = Merge(i,j);
46             if(res){
47                mergeCount++;
48                break;
49             }
50         }
51     }
52 
53     cout  endl;
54 
55     return 0;
56 }
57 
58 作者：defddr
59 链接：https://www.acwing.com/solution/AcWing/content/1590/
60 来源：AcWing
61 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。