eolymp
bolt
Try our new interface for solving problems
Try
Problems

Increasing subsequence

published at 7/15/16, 10:34:53 pm

Данная задача у меня проходит просто выводом размера максимальной подпоследовательности, то есть путь выводить не нужно!!! Почему это не указано в условии?

published at 1/9/19, 12:07:19 pm

Действительно, надо выводить только размер последовательности... У меня программа, которая неправильно выводила последовательность, но сам размер правильный. И 100%

published at 8/10/21, 11:21:20 am

They're really asking for strictly increasing subsequence (but in the statement they want increasing subsequence).

As I know, these two terms are defined differently.

increasing sequence is: a1, a2, ... , an such that ai <= ai+1 for all i = 1...n-1. strictly increasing is when ai < ai+1 for all i = 1...n-1.

I suggest to change the statement name to "Strictly increasing subsequence," since it caused uncertainty for me while trying to tell whether my algorithm was incorrect or I haven't read the statement well, when I got 53% accepted.