Can someone help me to solve this problem ? I try trie with sets in each vertex. It is TLE. how to reduce time?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
4 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
Can someone help me to solve this problem ? I try trie with sets in each vertex. It is TLE. how to reduce time?
Is there any RMQ algoritm with single element update and less time complexity than segment tree?
someone can help me to solve this problem?
here is problem about binomial coefficients someone can help me?
Name |
---|