String Modification CodeForces - 1316B (找规律)

题目链接

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
题解：根据题意多写几个例子会发现，k之后的字符串会移到前面，而1~k-1的字符串有的反转或不翻转接在后面，进一步可发现当k与n同奇偶时翻转。

        #include<bits/stdc++.h>
        using namespace std;
        const int maxn= 5e3+10;
        char s[maxn];
        char t[maxn];
        char res[maxn];
        int n;
        int main(){
        	int q;scanf("%d",&q);
        	while(q--){
        		scanf("%d%s",&n,s+1);
        		int ans=1;
        		strcpy(res+1,s+1);
        		for(int i=2;i<n;i++){
        			for(int j=i;j<=n;j++) t[j-i+1]=s[j];
        			if(n%2&&i%2||n%2==0&&i%2==0){
        				int p=n-i+1;
        				 for(int j=i-1;j>=1;j--) t[++p]=s[j];
        			}
        			else for(int j=1;j<i;j++) t[n-i+1+j]=s[j];
        			t[n+1]='\0';
        			if(strcmp(t+1,res+1)<0){
        				ans=i;strcpy(res+1,t+1);
        			}
        		}
        		reverse(s+1,s+1+n);
        		if(strcmp(s+1,res+1)<0){
        			strcpy(res+1,s+1);
        			ans=n;
        		}
        		printf("%s\n",res+1);
        		printf("%d\n",ans);
        	}
        	return 0;
        }