http://lightoj.com/volume_showproblem.php?problem=1093
I understood the problem but failed to understand the sample test cases.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
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.