非严格
const int MAXN = 100100;
const int INF = 0x3f3f3f3f;
int n;
int A[MAXN], S[MAXN];
int d[MAXN];
void init1()
{
for(int i = 1; i <= n; i++) S[i] = INF; //这很重要,与upper_bound有关。
memset(d, 0, sizeof(d));
}
int BSearch1(int x, int y, int v) //二分求上界
{
while(x <= y)
{
int mid = x+(y-x)/2;
if(S[mid] <= v) x = mid+1;
else y = mid-1;
}
return x;
}
int dp1()
{
init1();
int ans = 0;
for(int i = 1; i <= n; i++)
{
int x = 1, y = i;
int pos = BSearch1(x, y, A[i]);
d[i] = pos;
S[d[i]] = min(S[d[i]], A[i]);
ans = max(ans, d[i]);
}
return ans;
}
最长下降
void init2()
{
for(int i = 1; i <= n; i++) S[i] = -INF; //注意初始值
memset(d, 0, sizeof(d));
}
int BSearch2(int x, int y, int v)
{
while(x <= y)
{
int mid = x+(y-x)/2;
if(S[mid] >= v) x = mid+1; //注意看二分的变化
else y = mid-1;
}
return x;
}
int dp2()
{
init2();
int ans = 0;
for(int i = 1; i <= n; i++)
{
int x = 1, y = i;
int pos = BSearch2(x, y, A[i]);
d[i] = pos;
S[d[i]] = max(S[d[i]], A[i]); //max
ans = max(ans, d[i]);
}
return ans;
}