Flipper
题意:
给一个排列,要求做一次操作,选择一个区间,翻转区间中的数,同时区间前面的数全部挪到后面去,区间后面的数全部挪到前面去。求操作后的最大字典序,输出最大字典序的排列,n <= 2000。
思路:
因为n <= 2000 ,所以可以暴力,因为字典序要最大,所以得找到最大的数,把它放到最前面,因此,选择的区间右端点r得固定在最大数前面,因为必须要进行一次操作,所以最大数因该从i==2开始找,找到右端点后,枚举左端点l即可。具体看代码。
代码:
int n, a[maxn];
string get(int x) {
string ans;
while (x) {
ans += (x % 10 + '0');
x /= 10;
}
//ans.reserve();
string res;
for (int i = ans.size() - 1; i >= 0; i--) res += ans[i];
return res;
}
string mymax(string a, string b) {
if (a.size() > b.size()) return a;
if (a.size() < b.size()) return b;
string tem, temb;
for (int i = 0, j = 0; i < a.size() && j < b.size(); i++, j ++ ) {
tem = "";
while (a[i] != ' ') tem += a[i], i++;
temb = "";
while (b[j] != ' ') temb += b[j], j++;
if (tem.size() > temb.size()) return a;
if (tem.size() < temb.size()) return b;
if (tem > temb) return a;
if (tem < temb) return b;
}
if (tem.size() > temb.size()) return a;
if (tem.size() < temb.size()) return b;
if (tem > temb) return a;
if (tem < temb) return b;
return a;
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
string ans;
int r = n + 1;
int mx = 0;
for (int i = 2; i <= n; i++) {
if (a[i] > mx) {
mx = a[i];
r = i;
}
}
if (r == n) {
ans += get(a[n]) + " ";
for (int i = 1; i <= n - 1; i++) ans += get(a[i]) + " ";
}
if (r == 2) {
string tem;
for (int i = 2; i <= n; i++) tem += get(a[i]) + " ";
tem += get(a[1]) + " ";
ans = mymax(ans, tem);
}
r--;
for (int l = 1; l <= r; l++) {
string tem;
for (int i = r + 1; i <= n; i++) tem += get(a[i]) + " ";
for (int i = r; i >= l; i--) tem += get(a[i]) + " ";
for (int i = 1; i < l; i++) tem += get(a[i]) + " ";
ans = mymax(ans, tem);
}
cout << ans << endl;
}