f(l, r) = max(al,al+1...ar), g(l, r) = min(al, al+1...ar)
How can i calc ∑∑f(l,r) * g(l,r) mod 1e9 + 7?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
f(l, r) = max(al,al+1...ar), g(l, r) = min(al, al+1...ar)
How can i calc ∑∑f(l,r) * g(l,r) mod 1e9 + 7?
Name |
---|
Use a stack to find the l & r for each 'i' such that l <= i <= r and f(l, r) = a[i], and store these in an array 'big'. Do the same thing for each 'i' such that g(l, r) = a[i], and store these in an array 'small'. Both of these tasks can be done in O(N).
Let's try to find ∑ g(l, r). This can be done in O(N) by iterating through small and finding the sum of ∑ (a[i] * (small[i].r — small[i].l + 1)). It should be easy to understand why this is the case. Let's call this sum 'sum_g'.
Our answer turns out to be ∑ (a[i] * sum_g * (large[i].r — large[i].l + 1)). Of course, you should be careful with mods when calculating each quantity.