| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 2 | adamant | 160 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | atcoder_official | 148 |
| 6 | nor | 148 |
| 6 | SecondThread | 148 |
| 9 | TheScrasse | 146 |
| 10 | Petr | 144 |
Problem: Given an array of length $$$n$$$, find the number of increasing subsequences of length $$$k$$$, modulo $$$10^{9} + 7$$$.
I know that it can be done via the following DP, which can be optimized to $$$\mathcal O(nklogn)$$$ using a BIT or segment tree:
But could it be further optimized? I can't seem to find any mentions of a faster algorithm online.
Comments (0)
