Nyoj 214 Monotone Increment subsequence (ii)

#include <stdio.h>
#include <string.h>
const int maxn=100001;
int DP[MAXN],A[MAXN];
int binary_search (int len,int k)
{
Find a location that is smaller or equal than the first dp[i]
int start,end,mid;
Start=1;
End=len;
while (Start<=end)
{
Mid= (start+end) >>1;
if (K==dp[mid])
return mid;
if (K>dp[mid])
start=mid+1;
Else
End=mid-1;
}
return start;
}
int main ()
{
int N,i,t,len;
while (scanf ("%d", &n)!=eof)
{
Memset (Dp,0,sizeof (DP));
for (i=0;i<n;i++)
scanf ("%d", &a[i]);
Len=1;
DP[1]=A[0];
for (i=1;i<n;i++)
{
T=binary_search (Len,a[i]);//Find the location to insert by binary search
Dp[t]=a[i]; Updating the value of a DP
if (T>len)//If the position is inserted at the end, update the maximum length
len=t;
}
printf ("%d\n", Len);
}
}

Nyoj 214 Monotone Increment subsequence (ii)