1677.cpp

杭电 acm部分代码 有兴趣的可以下载 谢谢

#include <iostream>
#include <algorithm>
using namespace std;

struct rec
{
    int w, h;
}a[20010];

int dp[20010];

int cmp(rec x, rec y)
{
	if (x.w != y.w)
	{
		return x.w < y.w;
	}
	else
	{
		return x.h > y.h;
	}
}

int main()
{
    int test, n, i, m, high, low, mid;
    scanf("%d", &test);
    while (test--)
    {
        scanf("%d", &n);
        for (i = 0; i < n; i++)
        {
            scanf("%d %d", &a[i].w, &a[i].h);
        }
        sort(a, a + n, cmp);
        m = 0;
        dp[0] = a[0].h;
        for (i = 1; i < n; i++)
        {
            if (a[i].h <= dp[m])
            {
                m++;
                dp[m] = a[i].h;
                continue;
            }
            high = m;
            low = 0;
            while (high > low)
            {
                mid = (high + low) / 2;
                if (dp[mid] < a[i].h)
                {
                    high = mid;
                }
                else
                {
                    low = mid + 1;
                }
            }
            dp[low] = a[i].h;
        }
        printf("%d\n", m + 1);
    }
    return 0;
}