we define function f(i,j) on array A as below:
f(i,j) = (i-j)^2 + (A[i+1] + A[i+2] + A[i+3] + ... + A[j])^2
find the minimum value of function f.
2 <= A.size <= 10^5
-10^4 <= A[i] <= 10^4
# | 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 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
we define function f(i,j) on array A as below:
f(i,j) = (i-j)^2 + (A[i+1] + A[i+2] + A[i+3] + ... + A[j])^2
find the minimum value of function f.
2 <= A.size <= 10^5
-10^4 <= A[i] <= 10^4
Name |
---|
Firstly , we can make a cumulative sum array Prefix[i] . The function f(i,j) can be written as = ( i — j ) ^ 2 + ( Prefix[i] — Prefix[j] ) ^ 2 . Now this is analogous with closest pair point problem where each coordinate is ( i , Prefix[i] ) . The Complexity would be O(N log N ) .