package leetcode; import java.util.Arrays; import java.util.Scanner; public class Solution2 {     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);         int n = scanner.nextInt();         scanner.nextLine();         int []arr = new int[n];         for(int i=0;i<n;i++) {             arr[i] = scanner.nextInt();             scanner.nextLine();         }         int []score = new int[n];         Arrays.fill(score, 1);         int sum = 0;         for(int i=1;i<n;i++) {             if((arr[i]<arr[i-1])&&(score[i-1]>score[i]))                 continue;             if(arr[i]<arr[i-1]) {                 int s = i;                 while(s>=1&&(arr[s]<arr[s-1])) {                     score[s-1]++;                 }             }             else                 score[i] = score[i-1]+1;         }         for(int i=0;i<n;i++)             sum += score[i];         System.out.println(sum);     } }