Codeforces Round #323 (Div. 1) B. Once Again... (最长不下降序列_DP)
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true thatai = ai - n. Find the length of the longest non-decreasing sequence of
复制链接