导弹拦截

 题目就是让你找出一个  最长子序列   ， 一个是递增的  一个是递减的

#include "bits/stdc++.h"
#define ll long long
using namespace std;
const int N = 1e5+5;
int n;
int a[N],b[N],c[N];
bool cmp(int x, int y){
    return x>y;
}
int main()
{
    while (cin >> n){
        memset(b,0,sizeof(b));
        memset(c,0,sizeof(c));
       for(int i=1;i<=n;i++) cin >> a[i];
        b[1] = a[1];  // 单调递增
        c[1] = a[1]; // 单调递减
        int len1 = 1 , len2 = 1;
        for(int i=2;i<=n;i++){
            if(b[len1] < a[i]) b[++len1] = a[i];
            else{
                int p1= lower_bound(b+1,b+1+len1,a[i])-b;
                b[p1] = a[i];
            }
            if(c[len2] >= a[i]) c[++len2] = a[i];
            else{
                int p2 = upper_bound(c+1,c+1+len2,a[i],cmp) - c;
                c[p2]=a[i];
            }
        }

        cout << len2 << endl << len1 << endl;

    }

    return 0;

}