最短排序

class ShortSubsequence {
public:
int findShortest(vector<int> A, int n) {
int max=A[0],min=A[n-1],maxNum=-1,minNum=-1;
for(int i=1;i<n;++i){
if(max>A[i])
maxNum=i;
else
max=A[i];
}
for(int i=n-1;i>=0;--i){
if(min<A[i])
minNum=i;
else
min=A[i];
}
if(minNum==-1)
return 0;
else
return maxNum-minNum+1;
}
};