I'm trying to come up with a recursive solution for this problem but I haven't been able to so far. Any advice/pointers here?
I tried 0-1 knapsack style but there is an issue with backtracking the array.
# | 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 | maomao90 | 164 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
Count number of arrays with k-inversions
I'm trying to come up with a recursive solution for this problem but I haven't been able to so far. Any advice/pointers here?
I tried 0-1 knapsack style but there is an issue with backtracking the array.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 |
![]() |
aakarshmadhavan | 2018-08-09 07:59:46 | 288 | Initial revision (published) |
Name |
---|