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

I have my bet on jiangly, what about you guys?

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?