Please help me, the statement is: Give an matrix size n * m (n * m <= 10^6), from a square, we can move to 4 square that common side. Find the longest path that increasing
example:
3 5
1 2 2 8 9
2 3 1 7 10
1 4 5 6 1
10
Please help me, the statement is: Give an matrix size n * m (n * m <= 10^6), from a square, we can move to 4 square that common side. Find the longest path that increasing
example:
3 5
1 2 2 8 9
2 3 1 7 10
1 4 5 6 1
10
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
longest path on DAG
strictly increasing or increasing?
what would be the answer for this testcase.
2 2
1 1
1 1
tell me?
I suppose it would be strictly increasing. If it was increasing, the problem would probably be not possible to solve in polynomial time complexity for certain testcases