Vasya has a string s of length n. He decides to make the following modification to the string:

Pick an integer k, (1≤k≤n).
For i from 1 to n?k+1, reverse the substring s[i:i+k?1] of s. For example, if string s is qwer and k=2, below is the series of transformations the string goes through:
qwer (original string)
wqer (after reversing the first substring of length 2)
weqr (after reversing the second substring of length 2)
werq (after reversing the last substring of length 2)
Hence, the resulting string after modifying s with k=2 is werq.
Vasya wants to choose a k such that the string obtained after the above-mentioned modification is lexicographically smallest possible among all choices of k. Among all such k, he wants to choose the smallest one. Since he is busy attending Felicity 2020, he asks for your help.

A string a is lexicographically smaller than a string b if and only if one of the following holds:

a is a prefix of b, but a≠b;
in the first position where a and b differ, the string a has a letter that appears earlier in the alphabet than the corresponding letter in b.
Input
Each test contains multiple test cases.

The first line contains the number of test cases t (1≤t≤5000). The description of the test cases follows.

The first line of each test case contains a single integer n (1≤n≤5000) — the length of the string s.

The second line of each test case contains the string s of n lowercase latin letters.

It is guaranteed that the sum of n over all test cases does not exceed 5000.

Output
For each testcase output two lines:

In the first line output the lexicographically smallest string s′ achievable after the above-mentioned modification.

In the second line output the appropriate value of k (1≤k≤n) that you chose for performing the modification. If there are multiple values of k that give the lexicographically smallest string, output the smallest value of k among them.

Example
Input
6
4
abab
6
qwerty
5
aaaaa
6
alaska
9
lfpbavjsm
1
p
Output
abab
1
ertyqw
3
aaaaa
1
aksala
6
avjsmbpfl
5
p
1
Note
In the first testcase of the first sample, the string modification results for the sample abab are as follows :

for k=1 : abab
for k=2 : baba
for k=3 : abab
for k=4 : baba
The lexicographically smallest string achievable through modification is abab for k=1 and 3. Smallest value of k needed to achieve is hence 1.
思路：一開始以為是個思維題，但是按照思路寫了一發wa到第4個樣例了。。看著數據量不大，開始考慮暴力一下。所謂的暴力就是將所有的情況都考慮一遍。但是不能模擬著反轉一遍。這里找一下規律就可以了。
代碼如下：

#include<bits/stdc++.h> #define ll long long using namespace std;string s; int n;inline string fcs(int k) {if(k==n){reverse(s.begin(),s.end());return s;}if((n-k+1)%2==0){string o1=s.substr(k-1);string o2=s.substr(0,k-1);return o1+o2;}string o1=s.substr(k-1);string o2=s.substr(0,k-1);reverse(o2.begin(),o2.end());return o1+o2; } int main() {int t;scanf("%d",&t);while(t--){cin>>n>>s;string ss=s;int _min=1;for(int k=1;k<=n;k++){string sj=fcs(k);//cout<<sj<<endl;if(sj<ss) ss=sj,_min=k;}cout<<ss<<endl<<_min<<endl;}return 0; }

努力加油a啊，(^o)/~

創作挑戰賽新人創作獎勵來咯，堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的String Modification CodeForces - 1316B(规律)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。