Editorial for DMOPC '14 Contest 5 P3 - Brotherly Sequence
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
Author:
Notice that only checking whether and not
is sufficient. Initialize an array
of length
with
. For every element
in the range
that holds the brotherly sequence constraint, increase the length stored at
by
and assign it to
. The maximum value in
is the length of the longest brotherly subsequence.
Time Complexity:
Comments