http://lightoj.com/volume_showproblem.php?problem=1093
I understood the problem but failed to understand the sample test cases.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
http://lightoj.com/volume_showproblem.php?problem=1093
I understood the problem but failed to understand the sample test cases.
Name |
---|
Let the array of integers $$$A[0..n-1]$$$ be the numbers shown in the screen. The short-term memory implies that the player can compute the difference between two integers $$$A[i]$$$ and $$$A[j]$$$ only if $$$|i-j| \leq d-1$$$. The solution to this problem is the maximum difference over $$$(n-d+1)$$$ $$$d$$$-element windows (sub-arrays) expressed as follows.
$$$\max\limits_{i = 0}^{n-d}~~[ \max\limits_{j = i}^{i+d-1} A[j] - \min\limits_{j = i}^{i+d-1} A[j] ]$$$
For test case 1:
There are 5 $$$2$$$-element sub-arrays with differences $$$[6,8,0,0,4]$$$, and the answer is 8.
For test case 2:
There are 6 $$$3$$$-element sub-arrays with differences $$$[15,9,9,12,13]$$$, and the answer is 15.
For test case 3:
There is only one $$$2$$$-element sub-array with difference $$$[0]$$$, and the answer is 0.
thank you for explaining so nicely
With pleasure.