Increasing Subsequence (hard version)

题意翻译

题目描述 给你一个长度为 n 的序列，每次取出当前序列中最左或最右的数字，每次取出的数都要严格大于上一次取出的数，求最多取出多少数字。 输入格式 第一行一个整数 n (1 <= n <= 2*10^5) 第二行 n 个不超过 n 的整数表示原序列 输出格式 第一行输出最多取出的数字个数 k 第二行按顺序输出 k 个字符‘L’或‘R’表示每次取左边或右边 多解输出任意一组

题目描述

The only difference between problems C1 and C2 is that all values in input of problem C1 are distinct (this condition may be false for problem C2). You are given a sequence $ a $ consisting of $ n $ integers. You are making a sequence of moves. During each move you must take either the leftmost element of the sequence or the rightmost element of the sequence, write it down and remove it from the sequence. Your task is to write down a strictly increasing sequence, and among all such sequences you should take the longest (the length of the sequence is the number of elements in it). For example, for the sequence $ [1, 2, 4, 3, 2] $ the answer is $ 4 $ (you take $ 1 $ and the sequence becomes $ [2, 4, 3, 2] $ , then you take the rightmost element $ 2 $ and the sequence becomes $ [2, 4, 3] $ , then you take $ 3 $ and the sequence becomes $ [2, 4] $ and then you take $ 4 $ and the sequence becomes $ [2] $ , the obtained increasing sequence is $ [1, 2, 3, 4] $ ).

输入输出格式

输入格式

The first line of the input contains one integer $ n $ ( $ 1 \le n \le 2 \cdot 10^5 $ ) — the number of elements in $ a $ . The second line of the input contains $ n $ integers $ a_1, a_2, \dots, a_n $ ( $ 1 \le a_i \le 2 \cdot 10^5 $ ), where $ a_i $ is the $ i $ -th element of $ a $ .

输出格式

In the first line of the output print $ k $ — the maximum number of elements in a strictly increasing sequence you can obtain. In the second line print a string $ s $ of length $ k $ , where the $ j $ -th character of this string $ s_j $ should be 'L' if you take the leftmost element during the $ j $ -th move and 'R' otherwise. If there are multiple answers, you can print any.

输入输出样例

输入样例 #1

5
1 2 4 3 2

输出样例 #1

4
LRRR

输入样例 #2

7
1 3 5 6 5 4 2

输出样例 #2

6
LRLRRR

输入样例 #3

3
2 2 2

输出样例 #3

1
R

输入样例 #4

4
1 2 4 3

输出样例 #4

4
LLRR

说明

The first example is described in the problem statement.

题意翻译

题目描述 给你一个长度为 n 的序列，每次取出当前序列中最左或最右的数字，每次取出的数都要严格大于上一次取出的数，求最多取出多少数字。 输入格式 第一行一个整数 n (1 <= n <= 2*10^5) 第二行 n 个不超过 n 的整数表示原序列 输出格式 第一行输出最多取出的数字个数 k 第二行按顺序输出 k 个字符‘L’或‘R’表示每次取左边或右边 多解输出任意一组