Given an array of $n$ integers, count the number of subarrays where each element is dictinct.
The first line has an integer $n$ : the array size.
The second line has $n$ integers $x_1,x_2,\dots,x_n$ : the array contents.
Print the number of subarrays with distinct elements.
4 1 2 1 3\n · · · \n
8\n
The subarrays are $[1]$ (two times), $[2]$ , $[3]$ , $[1,2]$ , $[1,3]$ , $[2,1]$ and $[2,1,3]$ .