Hello,I'm very interested how to build a suffix array for a 2D matrix?.Can someone help me.Thanks...
Hello,I'm very interested how to build a suffix array for a 2D matrix?.Can someone help me.Thanks...
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
Can you please explain more concrate what do you want?
We have a matrix: 1 ≤the size of matrix ≤ 400
and integer
k;for this matrix we need to determine the maximum length of the side of a square area whose model appears in the matrix at least
ktimes without rotations. I am think about suffix array in 2D it is possible??in the example above the repeating most often submatrix is
which is repeat 2 time.
I don't have the link of the problem,I only have the problem on paper.
I know how to solve it for O(n2 * log3n) using hashs
1) Binary search for answer
2) Trying all possible matrixes with some side and saving their hashes
3) find most common element in hashes array and compare it with k