剑指offer--30.二叉搜索树的后序遍历序列

class Solution {
    public:
        bool VerifySquenceOfBST(vector<int> v) {
            int length=v.size();
            if(length==0)
                return false;
            int i=0;
            --length;
            while(v[i++]<v[length]);
            while(v[i++]>v[length]);
            if(i<length)
                return false;
            cout<<i<<" "<<length<<endl;
            return true;
        }
};