Number of unique longest increasing subsequence

Правка en1, от tugushka, 2017-02-05 15:06:32

Find number of unique longest increasing subsequence in array a.
Constraints : 1 <= Lenght of a <= 5000, 0 < a[i] < 2^31
Example input :
4
1 2 2 3
Example output :
1
Help me :v.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский tugushka 2017-02-05 15:06:32 266 Initial revision (published)