ZCMU2112美食家

【AC代码】：

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>memo;
int n,a[200000];
int max(int a,int b){
	return (a>b)?a:b;
}
int  findMC(int t,int m){
	if(t > n) return 0;
	if(m<=a[t]) {
		 return max(findMC(t+1,a[t])+1,findMC(t+1,m));
	}
	else findMC(t+1,m);
}


int main(){
	int i;
	while(scanf("%d",&n) == 1){
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		memo = vector<int>(n+1);
		for(i=1;i<=n;i++)
			memo[i] = findMC(i,a[i]);
			//每一次都把第i个物品当作最小的
		sort(memo.begin(),memo.end());
		cout<<memo[n]<<endl;

	}
}



#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;
int a[200010],l[200010]
int main() {
	int n,i,j;
	while(~scanf("%d",&n))
	{
		for(i = 1; i <= n; i++)
		{
			scanf("%d",&a[i]);
			l[i]=1;
		}
		for(i = 1; i <= n; i++)
		{
			for(j = 1; j < i; j++)
			{
				if(a[j]<=a[i]&&l[j]+1>l[i])
				{
					l[i]=l[j]+1;
				}
			}
		}
		int mmax = 1;
		for(i = 1; i <= n; i++)
		{
			if(mmax < l[i])
				mmax = l[i];
		}
		printf("%d\n",mmax);
	}
	return 0;
}




//LIS解法
#include<iostream>
#include<vector>
#include<cstdio>

using namespace std;
int n,i,a[200000];

int lengthOfThis(){
	for(i=1;i<n;i++){
		int t = b.back();
		if(a[i] >= t) b.push(a[i]);
		else{
			for(int j=i;j;j--){
				if(b[j]<a[i]) b[j] = a[i];
			}
		}
	}
	return b.size();
}
int main(){
	while(scanf("%d",&n) == 1){
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		vector<int>b(1);
		b[0] = a[0];
		int m = lengthOfThis();
		cout<<m<<endl;
	}
}