A - This is an interesting question

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l’ and weight w’ if l <= l’ and w <= w’. Otherwise, it will need 1 minute for setup.
You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .
Input
The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1 <= n <= 5000 , that represents the number of wooden sticks in the test case, and the second line contains 2n positive integers l1 , w1 , l2 , w2 ,…, ln , wn , each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.
Output
The output should contain the minimum setup time in minutes, one per line.
Sample Input
3
5
4 9 5 2 2 1 3 5 1 4
3
2 2 1 1 2 2
3
1 3 2 2 3 1
Sample Output
2
1
3

首先根据出l和w从小到大排序
求w的最长下降子序列
具体证明可以参考https://www.luogu.com.cn/problem/P1020的题解

#include<iostream>
#include<algorithm>
using namespace std;
struct point{
    int l,r;
}p[5010];
bool cmp(point &x,point &y)
{
    if(x.l==y.l) return x.r<y.r;
    return x.l<y.l;
}
int xl[5010];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,ans=1;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>p[i].l>>p[i].r;
        sort(p+1,p+n+1,cmp);
        int con=0;
        xl[0]=1e9;
        for(int i=1;i<=n;i++)
        {
            if(p[i].r<xl[con]) xl[++con]=p[i].r;
            else
            {
                int l=1,r=con,mid=l+r>>1;
                while(l<r)
                {
                    if(xl[mid]<=p[i].r) r=mid;
                    else l=mid+1;
                    mid=l+r>>1;
                }
                xl[mid]=p[i].r;
            }
        }
        cout<<con;
        if(t) puts("");
    }

}