题目

题目链接：https://codeforces.com/contest/1316/problem/B

思路

暴力+找规律
如果（n-i+1)%2==0
翻转到后面的那坨会再翻转。

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[30];
set<string> st;
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		string s;
		cin>>s;
		int pos=0;
		string temp,s1,s2,s3=s;
		for(int i=0;i<s.size();i++){
			s1=s.substr(0,i);
			s2=s.substr(i);
			if((n-i+1)%2==0){
				reverse(s1.begin(),s1.end()); 
			}
			temp=s2+s1;
			if(temp<s3){
				s3=temp;
				pos=i;
			}
		}
		cout<<s3<<endl;
		cout<<pos+1<<endl;
	} 
    return 0;
}