头条笔试第三题错误答案--求大佬查错

	import java.util.Scanner;



	





	public class Main {



	public static void main(String[] args) {



	Scanner sc = new Scanner(System.in);



	int cycles = sc.nextInt();



	for (int k = 0; k < cycles; k++) {



	int n = sc.nextInt();



	int[] scores = new int[n];



	for (int i = 0; i < n; i++) {



	scores[i] = sc.nextInt();



	}



	int[] leftOrder = new int[n];



	int[] rightOrder = new int[n];



	for (int i = 0; i < n; i++) {



	if (i == 0) {



	leftOrder[i] = scores[n - 1] < scores[i] ? 2 : 1;



	





	continue;



	}



	leftOrder[i] = scores[i - 1] < scores[i] ? leftOrder[i - 1] + 1 : 1;



	





	}



	rightOrder[n - 1] = scores[n - 1] > scores[0] ? 2 : 1;



	for (int i = n - 2; i >= 0; i--) {



	rightOrder[i] = scores[i + 1] < scores[i] ? rightOrder[i + 1] + 1 : 1;



	}



	int sum = 0;



	for (int i = 0; i < n; i++) {



	sum += Math.max(leftOrder[i], rightOrder[i]);



	}



	System.out.print(sum);



	}



	}



	}