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.
The first line contains one integer n (1 ≤ n ≤ 3·105) — the number of segments.
Each of the next n lines contains two integers li and ri (1 ≤ li ≤ ri ≤ 109) — the i-th segment.
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.
5 1 10 2 9 3 9 2 3 2 9
2 1
3 1 5 2 6 6 20
-1 -1
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.
一、原题地址
二、大致题意
给出n个线段的l和r。要求找出其中被覆盖的一组
三、思路
读入后按照 l 升序排序,l 相同时按照 r 降序排序。这样可以保证后一个线段的左端点大于等于当前端点的左端点。而此时只要保证后一个端点的右端点小于等于当前端点的右端点,则此时一定是一个符合条件的线段。
四、代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
const int inf=0x3f3f3f3f;
struct Node
{
int l,r,id;
}a[300005];
bool cmp(Node x,Node y)
{
if(x.l!=y.l)
return x.l<y.l;
else
{
if(x.r!=y.r)
return x.r>y.r;
else
return x.id<y.id;
}
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d %d",&a[i].l,&a[i].r);
a[i].id=i+1;
}
sort(a,a+n,cmp);
for(int i=1;i<n;i++)
{
if(a[i].r<=a[i-1].r)
{
printf("%d %d\n",a[i].id,a[i-1].id);
return 0;
}
}
printf("-1 -1\n");
getchar();
getchar();
}