最大递增子序列变形——二维 O（n*logn） TOJ4701

#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

class Node
{
public:
    int x;
    int y;
    bool operator <(const Node&n) const
    {
        return x<=n.x&&y<=n.y;
    }
};

bool cmp(Node a,Node b)
{
    if(a.x==b.x)
        return a.y<b.y;
    else
        return a.x<b.x;
}

Node arr[100010];
Node ans[100010];

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            cin>>arr[i].x>>arr[i].y;
        }
        sort(arr,arr+n,cmp);
        int siz=1;
        ans[0].x=arr[0].x;
        ans[0].y=arr[0].y;
        for(int i=1;i<n;i++)
        {
            int s=lower_bound(ans,ans+siz,arr[i])-ans;
            if(s==siz)
            {
                if(ans[s-1].x<=arr[i].x&&ans[s-1].y<=arr[i].y)
                {
                    ans[s].x=arr[i].x;
                    ans[s].y=arr[i].y;
                    siz++;
                }
            }
            else
            {
                ans[s].x=arr[i].x;
                ans[s].y=arr[i].y;
            }

        }
        cout<<siz<<endl;
    }
    return 0;
}