Plz help me in solving this problem?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Plz help me in solving this problem?
I recently started learning dynamic programming, while solving some classical problems I encountered 2D range sum, and this which were solved using dp with inclusion and exclusion. Can anyone explain how can I tackle this types of problems? Any help will be appreciated.
I was trying to solve this problem http://www.spoj.com/problems/GSS1/, after sometime I gave up and googled approach for it, I found this website https://kartikkukreja.wordpress.com/2014/11/09/a-simple-approach-to-segment-trees/ but still not able to understand problem and its solution.Plz help!
Name |
---|