import
java.util.*;
class
GFG {
public
static
int
minCost(
int
ratings[],
int
n)
{
int
res =
0
;
int
left2right[] =
new
int
[n];
int
right2left[] =
new
int
[n];;
Arrays.fill(left2right,
1
);
Arrays.fill(right2left,
1
);
for
(
int
i =
1
; i < n; i++)
if
(ratings[i] > ratings[i -
1
])
left2right[i] = left2right[i -
1
] +
1
;
for
(
int
i = n -
2
; i >=
0
; i--)
if
(ratings[i] > ratings[i +
1
])
right2left[i] = right2left[i +
1
] +
1
;
for
(
int
i =
0
; i < n; i++)
res += Math.max(left2right[i],
right2left[i]);
return
res;
}
public
static
void
main(String[] args)
{
int
ratings[] = {
1
,
6
,
8
,
3
,
4
,
1
,
5
,
7
};
int
n = ratings.length;
System.out.print(minCost(ratings, n));
}
}