wuzhibin

摘要： 时间复杂度 o(n*lgn);zLen(i),jLen(i)表示以a[i]为末尾元素的递增，递减序列的长度#include <iostream>#include <memory.h>using namespace std;#define length 10000int zLen[length+5],jLen[length+5];int q[length+5];int min(int x,int y){ return(x<=y?x:y);}int find(int* a,int eid,int num){ int left=0; int right=eid; whi 阅读全文