Input: a sequence <A_1, A_2, ..., A_n> of integers and an integer X.
Output: true if there is a subsequence of length X in sequence A, false otherwise.
Is there an O(n) algorithm for this problem ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Is there an increasing subsequence of length X in a given sequence of length N ? can you find it in O(n)?
Input: a sequence <A_1, A_2, ..., A_n> of integers and an integer X.
Output: true if there is a subsequence of length X in sequence A, false otherwise.
Is there an O(n) algorithm for this problem ?
Название |
---|