Hi any ways to check whether an array (1e5 items at most) has an arithmetic progression as a subsequence and output their positions?
for example 5
3 4 2 1 5
output 1 3 4
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 156 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
Hi any ways to check whether an array (1e5 items at most) has an arithmetic progression as a subsequence and output their positions?
for example 5
3 4 2 1 5
output 1 3 4
Название |
---|
Any two numbers form an arithmetic progression.
If you want 3 numbers, it seems like a harder version of 452F - Перестановка.