Problem from one local camp, how to solve?

Revision en1, by deepwork, 2018-11-15 07:02:06

Given 3 permutations of equal lengths n ≤ 105, let's call them A, B and C.
Find number of such i-s that there's no such j, that ( A i > A j and B i > B j and C i > C j)

History

Revisions

Rev. Lang. By When Δ Comment
en1 deepwork 2018-11-15 07:02:06 233 Initial revision (published)