题目链接
题意:给定一个字符串
S
=
s
1
s
2
s
3
.
.
.
s
n
S=s_1s_2s_3...s_n
S=s1s2s3...sn,有两个操作:
- 选择 i ( 2 ≤ i ≤ n − 1 ) i(2 \le i \le n-1) i(2≤i≤n−1),将子串 s 2 s 3 … s i s_2s_3 \ldots s_i s2s3…si反转后加到原串前;
- 选择 i ( 2 ≤ i ≤ n − 1 ) i(2 \le i \le n-1) i(2≤i≤n−1),将子串 s i s i + 1 … s n − 1 s_i s_{i + 1}\ldots s_{n - 1} sisi+1…sn−1反转后加到原串后;
要求在30次操作内将其转换为回文串
思路:其实本题构造方法就是第一个样例的方法,主要思路是将一端为中心构造回文串,我们以后端为中心构造为例:
- 将 s 2 s_2 s2放到字符串头
- 将子串 s 2 s 3 . . . s n − 1 s_2s_3...s_{n-1} s2s3...sn−1倒置放到串尾
- 将倒数第二个字符放到串尾
AC代码:
#include <bits/stdc++.h>
#define ll long long
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
/***************main****************/
ll T=1;
ll m,n;
int main() {
string s;
cin>>s;n=s.size();
cout<<3<<endl;
cout<<"L 2"<<endl;
cout<<"R 2"<<endl;
cout<<"R "<<2*n-1<<endl;
return 0;
}