题解戳这里:
http://gaotianyu1350.gitcafe.io/2015/04/23/BZOJ1178-%E4%BC%9A%E8%AE%AE%E4%B8%AD%E5%BF%83/
比较好的代码戳这里:
http://blog.csdn.net/Fuxey/article/details/50708546
我基本是抄的…>_<…
#include<set>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
//by:MirrorGray
using namespace std;
const int N=211111,inf=0x3f3f3f3f;
int cnt;
int x[N],y[N],nxt[N][21];
void read(int &x,char ch=0){
for(ch=getchar();ch<'0'||ch>'9';ch=getchar());
for(x=0;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar());
}
struct node{
int l,r;
node(int x=0,int y=0){
l=x;r=y;
}
bool operator <(const node&b)const{
return r<b.r;
}
}a[N],b[N];
set <node> s;
int calc(int L,int R){
int c=lower_bound(x+1,x+1+cnt,L)-x;
if(y[c]>R || c>cnt)return 0;
int ret=0;
for(int i=19;~i;i--)if(nxt[c][i]&&y[ nxt[c][i] ]<=R)
ret|= 1<<i ,c=nxt[c][i];
return ret+1;
}
int main(){
int n;scanf("%d",&n);
for(int i=1;i<=n;i++)read(a[i].l),read(a[i].r),b[i]=a[i];
sort(b+1,b+1+n);
for(int i=1;i<=n;i++)
if(b[i].l>b[cnt].l)b[++cnt]=b[i],x[cnt]=b[i].l,y[cnt]=b[i].r;
for(int i=1,j=1;i<=cnt;i++){
while(j<=cnt&&b[j].l<=b[i].r)j++;
if(j==cnt+1)break;
nxt[i][0]=j;
}
for(int j=1; 1<<j <=cnt;j++)for(int i=1;i+(1<<j)-1<=cnt;i++)
if(nxt[i][j-1])nxt[i][j]=nxt[ nxt[i][j-1] ][j-1];
printf("%d\n",calc(-inf,inf));
s.insert(node(-inf,-inf));s.insert(node(inf,inf));
for(int i=1;i<=n;i++){
set<node>::iterator t2=s.lower_bound(a[i]),t1;
t1=t2; t1--;
int j1=t1->r,j2=a[i].l,j3=a[i].r,j4=t2->l;
if(j1>=j2 || j3>=j4)continue;
if(calc(j1+1,j4-1)==calc(j1+1,j2-1)+1+calc(j3+1,j4-1)){
printf("%d ",i);
s.insert(a[i]);
}
}
return 0;
}