导弹拦截2

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1500;
int n,Height[maxn];
vector<int>Arr;
int main()
{   
	n=1;
	while(cin>>Height[n])
    n++;
	n--;
	Arr.clear();
	vector<int>::iterator Find;//用迭代器表示vector的始末 
	for(int i=n;i>=1;i--)//倒序的最长不下降子序列 
	{
		if((Arr.size()==0)||(Arr[Arr.size()-1]<=Height[i]))
		  Arr.push_back(Height[i]);
		else
		{
			Find=lower_bound(Arr.begin(),Arr.end(),Height[i]);
			while(*Find==Height[i])
			Find++;
			*Find=Height[i];
	    }
    }
    cout<<Arr.size()<<endl;
    Arr.clear();//赋初值 
    for(int i=1;i<=n;i++)//最长上升子序列 
    {
       if(Arr.size()==0||Arr[Arr.size()-1]<Height[i])
       Arr.push_back(Height[i]);
       else
	   {
	       Find=lower_bound(Arr.begin(),Arr.end(),Height[i]);
          *Find=Height[i];
       }
       
	}
	cout<<Arr.size();
    return 0;
}