Beautiful People ZOJ - 2319（单调递增子序列，记录路径）

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.

This problem contains multiple test cases!

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.

Input

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_irespectively (1 <= S_i, B_i <= 10⁹).

Output

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.

Sample Input

1

4
1 1
1 2
2 1
2 2

Sample Output

2

1 4

题意：t组数据，n个人，每个人都有si，和bi，只有后一个人比前一个人的bi值和si值都大的时候这两个人才能被邀请参加晚会，否则的话不能同时会邀请。

思路：si值从小到大排列，我们只需求bi值得最长单调递增子序列的长度就可以确定被邀请的人数。

代码：

#include <iostream>
#include<stdio.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<map>
#include<queue>
#include<vector>
#include<deque>
#define ll long long
#define inf 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
struct node
{
    int s,b,id;
} a[100009];
bool cmp(node a,node b)
{
    if(a.s==b.s)
        return a.b>b.b;
    else
        return a.s<b.s;
}
int dp[100009],ans[100009],mark[100009];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d",&a[i].s,&a[i].b);
            a[i].id=i;
        }
        sort(a+1,a+n+1,cmp);
        int len=0;
        dp[++len]=a[1].b;mark[1]=len;
        for(int i=2; i<=n;i++)
        {
            if(dp[len]<a[i].b)
            {
                dp[++len]=a[i].b;
                mark[i]=len;
            }
            else
            {
                int pos=lower_bound(dp+1,dp+1+len,a[i].b)-dp;//nlogn的时间复杂度
                dp[pos]=a[i].b;
                mark[i]=pos;
            }
        }
        printf("%d\n",len);
        int k=0;
        for(int j=n; j>=1; j--)
        {
            if(mark[j]==len)
            {
                ans[k++]=a[j].id;
                len--;
            }

        }
         sort(ans,ans+k);
        for(int i=0; i<k; i++)
        {
            if(i!=k-1)
                printf("%d ",ans[i]);
            else
                printf("%d\n",ans[i]);
        }
        if(t)printf("\n");
    }
}