Redirecting to
NADOS

K Increasing Subsequence 1

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

For the given sequence A with n different elements find the number of increasing subsequences with k  elements.
Input Format 
First line contains one integer n
Second line contains one integer k
following n lines contains elements of sequence
A[1]
A[2]
....A[n]
Output Format 
Print one number the andwer to question
Question Video
Constraints 
1. 1 <= n <= 10^5
2. 1 <= k <= 11
3. 1 <= A[i] <= n
4. Output may not fit in 32 bit signed integer
Sample Input 
5
3
1
2
3
5
4
Sample Output 
7


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name