B. Mirror in the String(字典序)

#include<iostream>
#include<cstring>
#include<cmath> 
#include<map> 
#include<algorithm>
using namespace std;

const int N = 1000;
int a[N];
int n;
void solve() {
	cin >> n;
	string s;
	cin >> s;
	int k = 0;
	for (int i = 0; i < n - 1; i ++) {
		if (s[i] > s[i + 1]) {
			k = i + 1;
		}
		else if (s[i] == s[i + 1] && s[i] < s[0]) {
			k = i + 1;
		}
		else break;
	}
	string a = s.substr(0, k + 1);
	string b = a;
	reverse(b.begin(), b.end());
	cout << a + b << endl;
}
int main(){
     int t;
    cin >> t;
    while (t --) solve();
	return 0;
}

注意baa baab baaab 需要和第一个进行比较看是不是更小的字典序