[CF709C] Letters Cyclic Shift（暴力）

题目链接：http://codeforces.com/contest/709/problem/C

题意：给一个字符串，选中一个连续区间修改，修改是将区间内字符顺时针转。问如何修改使得字符串字典序最小。

选中第一个非a的字符和第二个a字符之前作为区间修改即可。

 

  1 /*
  2 ━━━━━┒ギリギリ♂ eye！
  3 ┓┏┓┏┓┃キリキリ♂ mind！
  4 ┛┗┛┗┛┃＼○／
  5 ┓┏┓┏┓┃ /
  6 ┛┗┛┗┛┃ノ)
  7 ┓┏┓┏┓┃
  8 ┛┗┛┗┛┃
  9 ┓┏┓┏┓┃
 10 ┛┗┛┗┛┃
 11 ┓┏┓┏┓┃
 12 ┛┗┛┗┛┃
 13 ┓┏┓┏┓┃
 14 ┃┃┃┃┃┃
 15 ┻┻┻┻┻┻
 16 */
 17 #include <algorithm>
 18 #include <iostream>
 19 #include <iomanip>
 20 #include <cstring>
 21 #include <climits>
 22 #include <complex>
 23 #include <fstream>
 24 #include <cassert>
 25 #include <cstdio>
 26 #include <bitset>
 27 #include <vector>
 28 #include <deque>
 29 #include <queue>
 30 #include <stack>
 31 #include <ctime>
 32 #include <set>
 33 #include <map>
 34 #include <cmath>
 35 using namespace std;
 36 #define fr first
 37 #define sc second
 38 #define cl clear
 39 #define BUG puts("here!!!")
 40 #define W(a) while(a--)
 41 #define pb(a) push_back(a)
 42 #define Rint(a) scanf("%d", &a)
 43 #define Rs(a) scanf("%s", a)
 44 #define Cin(a) cin >> a
 45 #define FRead() freopen("in", "r", stdin)
 46 #define FWrite() freopen("out", "w", stdout)
 47 #define Rep(i, len) for(int i = 0; i < (len); i++)
 48 #define For(i, a, len) for(int i = (a); i < (len); i++)
 49 #define Cls(a) memset((a), 0, sizeof(a))
 50 #define Clr(a, x) memset((a), (x), sizeof(a))
 51 #define Full(a) memset((a), 0x7f7f7f, sizeof(a))
 52 #define lrt rt << 1
 53 #define rrt rt << 1 | 1
 54 #define pi 3.14159265359
 55 #define RT return
 56 #define lowbit(x) x & (-x)
 57 #define onecnt(x) __builtin_popcount(x)
 58 typedef long long LL;
 59 typedef long double LD;
 60 typedef unsigned long long ULL;
 61 typedef pair<int, int> pii;
 62 typedef pair<string, int> psi;
 63 typedef pair<LL, LL> pll;
 64 typedef map<string, int> msi;
 65 typedef vector<int> vi;
 66 typedef vector<LL> vl;
 67 typedef vector<vl> vvl;
 68 typedef vector<bool> vb;
 69 
 70 const int maxn = 100100;
 71 char s[maxn];
 72 int n;
 73 
 74 void convert(int x, int y) {
 75     for(int i = x; i < y; i++) {
 76         if(s[i] == 'a') s[i] = 'z';
 77         else s[i]--;
 78     }
 79 }
 80 
 81 int main() {
 82     // FRead();
 83     while(~Rs(s)) {
 84         n = strlen(s);
 85         bool ok = 0;
 86         int ss = 0x7f7f7f, tt = n;
 87         Rep(i, n) {
 88             if(s[i] != 'a') {
 89                 ss = i;
 90                 break;
 91             }
 92         }
 93         for(int i = ss+1; i < n; i++) {
 94             if(s[i] == 'a') {
 95                 tt = i;
 96                 break;
 97             }
 98         }
 99         if(ss == 0x7f7f7f) {
100             s[n-1] = 'z';
101         }
102         else {
103             convert(ss, tt);
104         }
105         printf("%s\n", s);
106     }
107 
108     RT 0;
109 }

 

转载于:https://www.cnblogs.com/kirai/p/5805249.html