Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > How Many Longest Increasing

How Many Longest Increasing

Difficulty: 1700 6000 ms 128 MB

dp

Print the NUMBER of longest strictly-increasing subsequences, modulo 109+7.

Input: the first line has N; the second line has N integers.

Output: the count of LIS of maximum length, mod 109+7.

Constraints:

  • 1 ≤ N ≤ 5000 (tests use N ≤ 1500)
  • |ai| ≤ 109

Sample Tests

Input 1
5
1 3 5 4 7
Output 1
2
Input 2
3
2 2 2
Output 2
3

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen