华为 合唱队 算法

package org.huawei.test;

import org.junit.Test;

import java.util.Arrays;

/**
 * Created by Administrator on 2016/10/7 0007.
 */
public class man {//合唱团


    @Test
    public  void que(){
        int [] high = {186,186,150,200,160,130,197,200};//input输入

        int [] tagUp = new int[high.length];
        int [] tagDown = new int[high.length];
        int [] tag = new int[high.length];
        for ( int i = 0 ; i < high.length;i++){
            for(int j = i ; j < high.length; j++){//求得每个位置的最长增序
                if (j == high.length-1){
                    break;
                }
                if (high[j] > high[j+1]){
                    tagUp[i] +=1;
                }else{
                    break;
                }
            }
            for (int j = i; j > 0; j--){//求得每个位置的最长减序
                if (j == 0){
                    break;
                }
                if (high[j]>high[j-1]){
                    tagDown[i] +=1;
                }else{
                    break;
                }
            }
        }
      for(int i = 0; i < tag.length;i++){
          if (tagDown[i] == 0 || tagUp[i] ==0){
              tag[i] = 0;
          }else{
              tag[i] = tagUp[i] + tagDown[i];
          }
      }
      for(int tmp : tag){
          System.out.println(tmp);
      }

      Arrays.sort(tag);
        System.out.println(tag.length-tag[tag.length-1]-1);
    }
}