最长上升序列、最长下降序列及其变形模板

#include <bits/stdc++.h>
using namespace std;
#define _for(i,a,b) for(int i=a;i<=b;i++)
const int maxn = 107;
int n,dp1[maxn],dp2[maxn],a[maxn],sum1[maxn],sum2[maxn];
int check(int x,int y)//下降序列
{
int l = 1;
int r = y;
int ans = 0;
while(l<=r)
{
int mid = (l+r)/2;
if(dp1[mid]<x)
{
r = mid-1;
ans = mid;
}
else l = mid+1;
}
return ans;
}
int checkgo(int x,int y)//上升序列
{
int l = 1;
int r = y;
int ans = 0;
while(l<=r)
{
int mid = (l+r)/2;
if(dp2[mid]>=x)
{
r = mid-1;
ans = mid;
}
else l = mid+1;
}
return ans;
}
int num(int x,int y)
{
memset(dp1,0,sizeof(dp1));
int ans = 1;
dp1[x]=a[x];
_for(i,x+1,y)
{
if(dp1[ans]>a[i])
{
dp1[++ans]=a[i];
}
else
{
int k = check(a[i],ans);
dp1[k]=a[i];
}
}
return ans;
}
int num2(int x,int y)
{
memset(dp2,0,sizeof(dp2));
dp2[x]=a[x];
int ans2 = 1;
_for(i,x+1,y)
{
if(dp2[ans2]<a[i])
{
dp2[++ans2]=a[i];
}
else
{
int k = checkgo(a[i],ans2);
dp2[k]=a[i];
}
}
return ans2;
}
int main(int argc, char const *argv[])
{
cin>>n;
_for(i,1,n)cin>>a[i];
int ans = 0;
_for(i,1,n)sum1[i]=num2(1,i);
_for(i,1,n)sum2[i]=num(i,n);
_for(i,1,n)cout<<sum2[i]<<" "<<sum1[i]<<endl;
return 0;
}