二分查找

int l=1,r=ls;
            int md;
            while (r>=l)
            {
                md=(r+l)/2;
                if (b[md]<a[i])
                l=md+1;
                else
                r=md-1;
            }
            b[l]=a[i];