LIS、LDS模板

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
const int N = 131072;

int a[N];
int LIS_regular (int n)		//严格上升 
{
	int len=0;
	int d[N];
	d[len]=a[0];
	for (int i=1;i<n;i++)
	{
		if (a[i]>d[len])
			d[++len]=a[i];
		else
		{
			int pos=lower_bound (d,d+len+1,a[i],less<int>() )-d;
			d[pos]=a[i];
		}
	} 
	return len+1;
}
int LIS_irregular (int n)	//非严格上升
{
	int len=0;
	int d[N];
	d[len]=a[0];
	for (int i=1;i<n;i++)
	{
		if (a[i]>=d[len])
			d[++len]=a[i];
		else
		{
			int pos=lower_bound (d,d+len+1,a[i],less_equal<int>() )-d;
			d[pos]=a[i];
		}
	} 
	return len+1;
} 
int LDS_regular (int n)		//严格下降 
{
	int len=0;
	int d[N];
	d[len]=a[0];
	for (int i=1;i<n;i++)
	{
		if (a[i]<d[len])
			d[++len]=a[i];
		else
		{
			int pos=lower_bound (d,d+len+1,a[i],greater<int>())-d;
			d[pos]=a[i];
		}
	} 
	return len+1;
}
int LDS_irregular (int n)	//非严格下降 
{
	int len=0;
	int d[N];
	d[len]=a[0];
	for (int i=1;i<n;i++)
	{
		if (a[i]<=d[len])
			d[++len]=a[i];
		else
		{
			int pos=lower_bound (d,d+len+1,a[i],greater_equal<int>())-d;
			d[pos]=a[i];
		}
	} 
	return len+1;
}
int main ()
{
	int n;
	scanf ("%d",&n);
	for (int i=0;i<n;i++)
		scanf ("%d",&a[i]);
	printf ("最长严格上升子序列长度: %d \n",LIS_regular(n));
	printf ("最长不严格上升子序列长度: %d \n",LIS_irregular(n));
	printf ("最长严格下降子序列长度: %d \n",LDS_regular(n));
	printf ("最长不严格下降子序列长度: %d \n",LDS_irregular(n));
    return 0;
}