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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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 |
---|