//找到从最小值开始的最长有序序列，动规遍历一遍，碰到更小的值归零？ int count; int curmin = 0; int dp[N];   for(int i = 0; i < N; i++){     if(a[i] > curmin){         if(a[i] > a[i] - 1){             dp[i] = dp[i - 1] + 1;         }         else{             dp[i] = dp[i - 1];         }     }     else{         curmin = i;         dp[i] = 0;     } } count = N - dp[N-1];