[HackerEarth] Given three sorted arrays P, Q, and R of size X, Y and Z respectively. Find total number of triplets (P[i],Q[j],R[k]) such that P[i] ≤ Q[j] ≤ R[k] where 1 ≤ i ≤ X, 1 ≤ j ≤ Y and 1 ≤ k ≤ - 题解

暂无题解