笔试------序列问题

一个序列，由于序列里的元素排列不一，需要序列变成单调的，处理的时候只能删掉序列里的某一个元素。
单调是指序列需要严格的单调递增或单调递减。

输入

2                                           //两组数据
5                                          //五个元素
1 4 2 3 5
5
4 5 3 2 1

输出

1
1

本人用深度优先用的比较蠢

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class test {
    public static int count;
    public static int numb;
    public static int t=0;
//    public static int min;
    public static int[] a=new int[999];
    public static int[] b=new int[999];
    public static int n,len;    //n：n组数组 ； len：数组长度
    public static void main(String[] args) throws IOException {
 //       Scanner sc=new Scanner(System.in);
 //       int n=sc.nextInt();
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          n=Integer.parseInt(br.readLine());

 //       int[] b = new int[0];
        for(int i=0;i<n;i++) {
            len =Integer.parseInt(br.readLine());
            String inputString = br.readLine();
            String stringArray[] = inputString.split(" ");
                        for (int j = 0; j < stringArray.length; j++) {
                a[j] = Integer.parseInt(stringArray[j]);
            }
            numb=count=0;
            count=stringArray.length;
            int t1=dfs1(0,1,0);
            System.out.println(t1);
            numb=0;
            count=stringArray.length;
            int t2=dfs2(0,1,0);
           System.out.println(t2);
            numb=t1<t2?t1:t2;

            b[i]=numb;
//            sort(b);

        }
        for(int i=0;i<n;i++){
        System.out.println(b[i]);
        }

    }
        public static int dfs1(int i,int j,int min){
        if(j>=len-1) {
            if(a[i] < a[j]) {
                count =count<=min?count:min;
            }else{
                count=count+1;
                min=min+1;
                count =count<=min?count:min;
            }
//            return min;
        }else if(min<=count){
            if (a[i] < a[j]) {
                dfs1(j,j+1,min);
                count++;
                dfs1(i,j+1,min+1);
                dfs1(i+1,i+2,i+1);                                //跳过开头
//                dfs1(j,j+1,min);
            } else {
                count++;
                dfs1(i ,j+1,min+1);
                dfs1(i+1,i+2,i+1);                                //
            }
        }
        if(numb==0){
            numb=count;
        }else{
            numb=numb<count?numb:count;
        }
        System.out.println(t++);
        return numb;
    }

    public static int dfs2(int i,int j,int min){
        if(j>=len-1) {
            if(a[i] > a[j]) {
                count =count<=min?count:min;
            }else {
//                count=count+1;
                min=min+1;
                count =count<=min?count:min;
            }
        }else if(min<=count){
            if (a[i] > a[j]) {
                dfs2(j,j+1,min);
//                count++;
                dfs2(i,j+1,min+1);
                dfs2(i+1,i+2,i+1);
            } else {
//                count++;
                dfs2(i ,j+1,min+1);
                dfs2(i+1,i+2,i+1);
            }
        }
        if(numb==0){
            numb=count;
        }else{
            numb=numb<count?numb:count;
        }
        return numb;
    }

}