| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 7 | cnnfls_csy | 3569 |
| 9 | ecnerwala | 3494 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 4 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | maroonrk | 152 |
Hi, I have this DnC problem, I would greatly appreciate any help, thank you!
Given an array a with n elements, calculate the sum of min * max over every ranges [l, r] (1 <= l <= r <= n)
Constraints:
1 <= n <= 1e5, 1 <= a_i <= 1e9
Sample test:
4
1 4 3 1
Answer: 58
Hello, I'm doing this problem, the statement is in Vietnamese, therefore I'll give you a summary:
Given n rectangles on a 2D coordination (x, y, w, h), two rectangles are connected if any of it's edges touches, find the largest connected rectangles area (w, h <= 500), no rectangles overlaps with each other and each rectangle is (x, y, x + w, y + h)
The editorial suggested using DSU combined with sweep line, however I'm still not clear on it, I'd appreciate some help, thanks!
I struggle hard with this sometimes, contests are the only thing that would enforce it for me, how do you guys do it?
https://codeforces.net/submissions/chillhouse7773/contest/1883
This account's behavior is very strange, submitted A and B at the same time, not to mention with different templates, other submissions have used a different templates as well, isn't it strange?
