Title
CodeForces 1400 D. Zigzags
Time Limit
2 seconds
Memory Limit
256 megabytes
Problem Description
You are given an array a 1 , a 2 … a n a_1, a_2 \dots a_n a1,a2…an. Calculate the number of tuples ( i , j , k , l ) (i, j, k, l) (i,j,k,l) such that:
- 1 ≤ i < j < k < l ≤ n 1\le i<j<k<l\le n 1≤i<j<k<l≤n
- a i = a k a_i=a_k ai=akand a j = a l a_j=a_l aj=a