codevs-3955 最长不上升子序列

大家都很强， 可与之共勉。

#include "cctype"
#include "cstdio"
#include "cstring"

#define max(a, b)  ((a) > (b) ? (a) : (b))

inline void readIn(unsigned int& x)  {
static char ch;
while ( !isdigit(ch = getchar()) );
for (x = -48 + ch; isdigit(ch = getchar()); (x *= 10) += ch - 48);
}

const unsigned int MaxN = 1000005;

unsigned int n, k, ans, q[MaxN], a[MaxN];

inline unsigned int Binary_Search(unsigned int* s, int val)  {
static unsigned int l, r, mid;
l = 1, r = n;
while(l ^ r)  {
mid = (l + r) >> 1;
(s[mid] < val) ? l = mid + 1 : r = mid;
}
return l;
}

int main()  {
register int i;
readIn( n );
for ( i = 0; i ^ n; readIn(a[++i]) );
memset(q, 0x3f, sizeof (unsigned int) * (n + 1));
for ( i = 1; i <= n; ++i)  {
k = Binary_Search(q, a[i]);
q[k] = a[i];
ans = max(ans, k);
}
printf("%d\n", ans);
}

#include "cctype"
#include "cstdio"
#include "cstring"

#define max(a, b)  ((a) > (b) ? (a) : (b))

inline void readIn(unsigned int& x)  {
static char ch;
while ( !isdigit(ch = getchar()) );
for (x = -48 + ch; isdigit(ch = getchar()); (x *= 10) += ch - 48);
}

const unsigned int MaxN = 1000005;

unsigned int n, len, q[MaxN], a[MaxN];

inline unsigned int Binary_Search(unsigned int* s, int len, int val)  {
static unsigned int l, r, mid;
l = 1, r = len;
while(l ^ r)  {
mid = (l + r) >> 1;
(s[mid] < val) ? l = mid + 1 : r = mid;
}
return l;
}

int main()  {
register int i;
readIn( n );
for ( i = 0; i ^ n; readIn(a[++i]) );
q[++len] = a[1];
for  ( i = 2; i <= n; ++i )
(a[i] > q[len]) ? q[++len]=a[i] : q[Binary_Search(q, len, a[i])] = a[i];
printf("%d\n", len);
}