Big Achiever

Given $N$ students standing in a row, each student $i$ has an **distinct** achievement score $A_i$ provided in an array $A = [A_1, A_2, \dots, A_n]$. The array $A$ consists of distinct integers from $1$ to $N$. A student $i$ ( $1 \leq i \leq N$ ) will be happy if their achievement score $A_i$ is greater than the achievement scores of all the students standing before them in the array. The task