首先dp[i][j],i代表当前的位置,j代表已经消耗了多少能量,转移方程很好推
dp[i][j] = max ( dp[k][j] + 1 , dp[k][j-1] + 1 ) 如果a[k][m]<a[i][m]
那么直接做是n^3,会超时,那么我们可以把求最长子序列优化到nlogn,比较常见的是应用树状数组
下面我提供一个二分求取的方法,就用数组d[i][m],记录长度为i且消耗能量为m时的最小的序列尾部的值,维护即可,因为按长度排的数组是有序的,故可以用二分法查询,就可以将找最大的这一过程优化到logn
需要注意的是m的循环要从m-1走,利用了1/0背包的思想,防止重复的错误更新,自己可以揣摩一下......
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define MAX 1007
using namespace std;
int d[MAX][MAX];
int dp[MAX][MAX];
int find ( int value , int m1 , int m2 , int n )
{
int left = 0 , right = n-1 , mid ;
while ( left != right )
{
mid = (left + right+1) >> 1;
//cout <<left << " " << mid << " " << right << endl;
if ( value > d[mid][m1] ) left = mid;
else right = mid-1;
}
d[left+1][m2] = min ( d[left+1][m2] , value );
return left+1;
}
int main ( )
{
int n,m,t;
int a[MAX];
int b[MAX];
scanf ( "%d" , &t );
while ( t-- )
{
memset ( dp , 0 , sizeof ( dp ) );
memset ( d , 0x3f , sizeof ( d ) );
/* for ( int i = 1; i <= n ; i++ )
for ( int j = 0 ; j <= m ; j++ )
d[i][j] = 1000000001;*/
for ( int i = 0 ; i <= m ; i++ )
d[0][i] = 0;
scanf ( "%d%d" , &n , &m );
for ( int i = 1 ; i <= n ; i++ )
scanf ( "%d%d" , &a[i] , &b[i] );
int ans = 0;
for ( int i = 1 ; i <= n ; i++ )
for ( int j = m ; j >= 0 ; j-- )
{
dp[i][j] = max ( dp[i][j] , find ( a[i] , j , j ,i ) );
if ( j > 0 )
dp[i][j] = max ( dp[i][j] ,find ( b[i] , j-1 , j , i ) );
ans = max ( dp[i][j] , ans );
}
printf ( "%d\n" , ans );
}
return 0;
}