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

来源：互联网发布：网络地板和防静电地板编辑：程序博客网时间：2024/06/07 16:49
#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 longusing 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];        int sub;        for(int i=1; i<n; i++)        {            sub=bsearch(a[i],top);            l[i]=sub+1;            q[sub]=a[i];            if(sub==top)                top++;        }        r[n-1]=1;        top=1;        q[0]=a[n-1];        for(int i=n-2; i>=0; i--)        {            sub=bsearch(a[i],top);            r[i]=sub+1;            q[sub]=a[i];            if(sub==top)                top++;        }        int maxv=1,temp;        for(int i=0;i<n-1;i++)        {            temp=min(l[i],r[i]);            if(temp>maxv)            maxv=temp;        }        printf("%d\n",maxv*2-1);    }    return 0;}