# | User | Rating |
---|---|---|
1 | tourist | 3851 |
2 | jiangly | 3634 |
3 | Um_nik | 3539 |
4 | slime | 3498 |
5 | ksun48 | 3493 |
6 | djq_cpp | 3486 |
7 | maroonrk | 3471 |
8 | MiracleFaFa | 3466 |
9 | Radewoosh | 3442 |
10 | Petr | 3426 |
# | User | Contrib. |
---|---|---|
1 | -is-this-fft- | 183 |
2 | awoo | 181 |
3 | YouKn0wWho | 177 |
4 | Um_nik | 175 |
5 | dario2994 | 172 |
6 | Monogon | 170 |
6 | adamant | 170 |
8 | maroonrk | 169 |
9 | errorgorn | 166 |
10 | antontrygubO_o | 165 |
+11
You might run out of positions for other parity. Try this case 5 4 1 2 3 4 1 |
0
Can you explain your dp state ? |
0
How to solve I ? |
0
Logic seems right,may be a bug in implementation |
0
In problem F, How does one get an idea to consider the parity of inversions ? I mean it is not at all obvious to me . If this is a popular idea , can someone give some problems related to it ? |
0
Thanks |
0
Can anyone give some problems for Segment Tree with Tries,Thanks in Advance |
Name |
---|