A10140 | $Subsequences$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

For the given sequence with $n$ different elements find the number of increasing subsequences with $k+1$ elements. It is guaranteed that the answer is not greater than $8·10^{18}$ .

First line contain two integer values $n$ and $k$ $(1<=n<=10^{5},0<=k<=10)$ — the length of sequence and the number of elements in increasing subsequences. Next $n$ lines contains one integer $a_{i}$ ( $1<=a_{i}<=n$ ) each — elements of sequence. All values $a_{i}$ are different.

Print one integer — the answer to the problem.

输入 #1

输出 #1

C++ 编辑器

输入

输出