Problem from one local camp, how to solve?

Правка en1, от prudent, 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 (Ai > Aj and Bi > Bj and Ci > Cj)

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский prudent 2018-11-15 07:02:06 233 Initial revision (published)