题意:给你N段线段,输出任意一个可以删掉的线段,删掉之后不改变原来的线段覆盖范围。
解:
1.将数据离散化保存,每个线段贡献3个数据,l,r,r+1
2、然后利用基于前缀和线段修改
3、线段树查询最值。
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn =6e5+10;
const ll inf=0x3f3f3f3f;
ll rd(){ll t;scanf("%I64d",&t);return t;}
#define en '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define pb push_back
#define all(x) x.begin() ,x.end()
vector<int>vec;
int a[maxn];
struct node{
int l,r;
}seg[maxn];
int n,mi[maxn<<2];
void up(int x){mi[x]=min(mi[x<<1],mi[x<<1|1]);}
#define lson x<<1 ,l,mid
#define rson x<<1|1,mid+1,r
void build(int x,int l,int r){
if(l==r){
mi[x]=a[l];return ;
}
int mid=l+r>>1;
build(lson),build(rson);
up(x);
}
int ask(int x,int l,int r,int ql,int qr){
if(ql<=l and r<=qr )return mi[x];
int mid=l+r>>1;
int tem1=inf,tem2=inf;
if(ql<=mid)tem1=ask(lson,ql,qr);
if(qr>mid)tem2=ask(rson,ql,qr);
return min(tem1,tem2);
}
signed main() {
#ifdef swt
freopen("input2.txt","r",stdin);
#endif // locals
cin>>n;
for(int i=1;i<=n;i++){
seg[i].l=rd(),seg[i].r=rd();
vec.pb(seg[i].l),vec.pb(seg[i].r);
vec.pb(seg[i].r+1);
}
sort(vec.begin(),vec.end());
vec.resize(unique(vec.begin(),vec.end())-vec.begin());
for(int i=1;i<=n;i++){
int x=lower_bound(all(vec),seg[i].l)-vec.begin();
int y=lower_bound(all(vec),seg[i].r+1)-vec.begin();
a[x]+=1,a[y]-=1;
}
for(int i=1;i<=vec.size();i++){
a[i]+=a[i-1];
}
build(1,0,vec.size()-1);
for(int i=1;i<=n;i++){
int xx=lower_bound(all(vec),seg[i].l)-vec.begin();
int yy=lower_bound(all(vec),seg[i].r)-vec.begin();
if(ask(1,0,vec.size()-1,xx,yy)>=2){
cout<<i<<en;return 0;
}
}
cout<<-1<<en;
return 0 ;
}