cf Educational Codeforces Round 43 C. Nested Segments

原题：
C. Nested Segments
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given a sequence a1, a2, …, an of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment ai lies within segment aj.

Segment [l1, r1] lies within segment [l2, r2] iff l1 ≥ l2 and r1 ≤ r2.

Print indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.

Input
The first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.

Each of the next n lines contains two integers li and ri (1 ≤ li ≤ ri ≤ 10^9) — the i-th segment.

Output
Print two distinct indices i and j such that segment ai lies within segment aj. If there are multiple answers, print any of them. If no answer exists, print -1 -1.

Examples
input
5
1 10
2 9
3 9
2 3
2 9
output
2 1
input
3
1 5
2 6
6 20
output
-1 -1
Note
In the first example the following pairs are considered correct:

(2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;
(3, 2), (4, 2), (3, 5), (4, 5) — touch one border;
(5, 2), (2, 5) — match exactly.

中文：

给你一堆线段，然你随意找出两个能互相嵌套的线段，输出线段的下标。

代码：

#include <bits/stdc++.h>
using namespace std;
const int maxn = 300001;
struct node
{
    int l,r,ind;
};
int n;
node seg[maxn];
int cmp(const node &a,const node &b)
{
    if(a.l==b.l)
        return a.r<b.r;
    return a.l<b.l;
}
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>n)
    {
        for(int i=1;i<=n;i++)
        {
            cin>>seg[i].l>>seg[i].r;
            seg[i].ind=i;
        }
        sort(seg+1,seg+1+n,cmp);
        int flag=1;
        for(int i=1;i<n;i++)
        {
            if(seg[i].l==seg[i+1].l)
            {
                flag=0;
                if(seg[i].r<seg[i+1].r)
                {
                    cout<<seg[i].ind<<" "<<seg[i+1].ind<<endl;
                }
                else
                {
                    cout<<seg[i+1].ind<<" "<<seg[i].ind<<endl;
                }
                break;
            }
            else
            {
                if(seg[i].r>=seg[i+1].l&&seg[i].r>=seg[i+1].r)
                {
                    flag=0;
                    cout<<seg[i+1].ind<<" "<<seg[i].ind<<endl;
                    break;
                }

            }
        }
        if(flag)
        {
            cout<<-1<<" "<<-1<<endl;
        }
    }
    return 0;
}

思路：

上来就线段树那可太看得起这道题了。。

首先按照左端点排序

那么相邻的两个线段有3种情况

第i个线段的右端点小于第i+1个线段的左端点，此时枚举下一线段进行判断

第i个线段的右端点大于第i+1个线段的左端点，而且第i+1个线段的右端点大于第i个线段的右端点，此时枚举下一个点的进行判断

第i个线段的右端点大于第i+1个线段的左端点，第i+1个线段的右端点小于第i个线段的右端点，出现包含的情况，break即可