DP
for(int i = 1; i <= n; i++)
for(int j = 1; j < i; j++)
if(a[j] < a[i])
f[i] = max(f[i], f[j]+1);
for(int i = 1; i <= n; i++)
ans = max(ans, f[i]);
可以记录子序列结尾
二分写法
最长不下降子序列(不严格上升)
测试数据 13,7,9,16,38,24,37,18,44,19,21,21,22,63,15
stack<int> sta;
int len = 0;
f[0] = 0;
for(i = 1; i <= n; i++)
{
if(a[i] >= f[len])
{
f[++len] = a[i];
c[i] = len;
}
else
{
int j = upper_bound(f+1, f+len+1, a[i]) - f; //找到第一个大于的,所以用 upper_bound(), 等于的不替换
f[j] = a[i];
c[i] = j;
}
}
cout << len << endl;
for(i = n; i >= 1; i--)
{
if(c[i] == len)
{
sta.push(a[i]);
--len;
}
if(len == 0)
break;
}
while(!sta.empty())
{
cout << sta.top() << ' ';
sta.pop();
}
最长不上升子序列(不严格下降)
测试数据 15,63,22,21,21,19,44,18,37,24,38,16,9,7,13
stack<int> sta;
int len = 0;
f[0] = 0x3f3f3f3f;
for(i = 1; i <= n; i++)
{
if(a[i] <= f[len])
{
f[++len] = a[i];
c[i] = len;
}
else
{
int j = upper_bound(f+1, f+len+1, a[i], greater<int>()) - f;
f[j] = a[i];
c[i] = j;
}
}
cout << len << endl;
for(i = n; i >= 1; i--)
{
if(c[i] == len)
{
sta.push(a[i]);
--len;
}
if(len == 0)
break;
}
while(!sta.empty())
{
cout << sta.top() << ' ';
sta.pop();
}
小总结 搭配
(1)上升
①严格 > lower_bound()
②不严格 >= upper_bound()
(2)下降
①严格 < lower_bound() greater< int > ()
②不严格 <= upper_bound() greater< int > ()
参考
https://www.cnblogs.com/milky-w/p/8431333.html