Weird Values

You are given an array $A = [A_1, A_2, \ldots, A_N]$ containing $N$ integers. Consider any subarray $[A_L, A_{L+1}, \ldots, A_R]$ of this subarray (where $1\leq L \leq R \leq N$). Ther `weirdness` of this subarray, denoted $w(L, R)$, is defined to be the number of indices $L \leq i \leq R$ such that $A_i$ equals the number of occurrences of $A_i$ in this subarray. Formally, we define $w(L, R)$ f