Beautiful People
The most prestigious sports club in one city has exactly N members. Each of its members is strong and beautiful. More precisely, i-th member of this club (members being numbered by the time they entered the club) has strength S_i and beauty B_i. Since this is a very prestigious club, its members are very rich and therefore extraordinary people, so they often extremely hate each other. Strictly speaking, i-th member of the club Mr X hates j-th member of the club Mr Y if S_i <= S_j and B_i >= B_j or if S_i >= S_j and B_i <= B_j (if both properties of Mr X are greater then corresponding properties of Mr Y, he doesn��t even notice him, on the other hand, if both of his properties are less, he respects Mr Y very much).

To celebrate a new 2005 year, the administration of the club is planning to organize a party. However they are afraid that if two people who hate each other would simultaneouly attend the party, after a drink or two they would start a fight. So no two people who hate each other should be invited. On the other hand, to keep the club prestige at the apropriate level, administration wants to invite as many people as possible.

Being the only one among administration who is not afraid of touching a computer, you are to write a program which would find out whom to invite to the party.

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

The first line of the input file contains integer N - the number of members of the club. (2 <= N <= 100 000). Next N lines contain two numbers each - S_i and B_i respectively (1 <= S_i, B_i <= 10⁹).

On the first line of the output file print the maximum number of the people that can be invited to the party. On the second line output N integers - numbers of members to be invited in arbitrary order. If several solutions exist, output any one.

1

4
1 1
1 2
2 1
2 2

2
1 4

Author: Andrew Stankevich
很猥琐的最长上升子序列，写的很猥琐 ，输出为给出序列的序号，因为这个错了几次 开始的时候二分写错一直TLE
部分代码如下

#include < cstdio >
#include < cstring >
#include < algorithm >
#define  MAXN 120000
using   namespace  std;
struct  NODE {
     int  x,y,mark;
} arr[MAXN],num[MAXN];
bool  OK;
int  pre[MAXN],root[MAXN];
int  n,top,max_sum,best_road;
int  Search( int  now) {
     int  left = 0 ,right = top,mid;
     while (left < right) {
        mid = (right + left) >> 1 ;
         if (num[mid].y >= now)right = mid;
         else  left = mid + 1 ;
    }
    mid = (left + right) >> 1 ;
     return  mid;    
}
bool  cmp(NODE a,NODE b) {
     if (a.x != b.x) return  a.x < b.x;
     return  a.y < b.y;    
}
void  PRINT( int  x) {
     if (pre[x])PRINT(pre[x]);
     if (OK)printf( "   " );
     else  OK = true ;
    printf( " %d " ,arr[x - 1 ].mark);
}
int  main() {
     int  cases,i,j,now;
    scanf( " %d " , & cases);
    num[ 0 ].x = num[ 0 ].y = 0 ;
     while (cases -- ) {
        max_sum = 0 ,top = 1 ;
        scanf( " %d " , & n);
         for (i = 0 ;i < n;i ++ ) {
            arr[i].mark = i + 1 ;
            scanf( " %d %d " , & arr[i].x, & arr[i].y);    
        }
        sort(arr,arr + n,cmp);
        memset(pre, 0 , sizeof (pre));
        memset(num, 0 , sizeof (num));
         for (i = 0 ;i < n;i ++ ) {    
             for (j = now;j < i + 1 ;j ++ ) {
                 int  t = Search(arr[j].y);
                root[j] = t;pre[j + 1 ] = num[t - 1 ].x;
                 if (max_sum < t) {
                    max_sum = t;best_road = j + 1 ;    
                }     
            }
             for (j = now;j < i + 1 ;j ++ ) {
                 if (root[j] == top) {
                    num[top].x = j + 1 ;
                    num[top ++ ].y = arr[j].y;    
                }
                 else   if (arr[j].y < num[root[j]].y) {
                    num[root[j]].x = j + 1 ;
                    num[root[j]].y = arr[j].y;    
                }     
            }
        }
        OK = false ;
        printf( " %d\n " ,max_sum);
        PRINT(best_road);printf( " \n " );
    }
}