10534 - Wavio Sequence---使用nlgn实现的

#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<set>
#include<cstring>
#include <algorithm>
#define inf 0x7fffffff
#define N 10000
#define MIN 1e-11
#define M 100
#define LL long long
using namespace std;
int n,k,h,t,m;
int a[N],l[N],r[N];
int q[N],top;
int bsearch(int key,int top)
{
    int l=0,r=top-1;
    while(l<r)
    {
        int mid=(l+r)>>1;
        if(q[mid]<key)
            l=mid+1;
        else
            r=mid;
    }
    if(l==top-1&&q[l]<key)
        l++;
    return l;
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("ex.in","r",stdin);
#endif
//    scanf("%d%*c%*c",&t);


    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0; i<n; ++i)
            scanf("%d",&a[i]);
        l[0]=1;
        top=1;
        q[0]=a[0];