| # | 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 | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
help on "Polynomial Queries" CSES problem
I tried to solve this problem and spend alot of time and all I got O(N*log^2N) solution (segment tree) which got TLE on it Polynomial Queries
simply the problem is about increase range (a, b) the 1st element by 1, 2nd by 2, and so on like arithmetic sequence and answering queries online
any help would be appreciated :-)
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
It_Wasnt_Me | 2020-06-16 20:21:44 | 15 | Tiny change: ' solution which got' -> ' solution (segment tree) which got' | |
| en1 |
|
It_Wasnt_Me | 2020-06-16 20:01:34 | 395 | Initial revision (published) |
