【HDOJ】4162 Shape Number

循环串的最小表示法。

 /*  */
 #include <iostream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 #define lson            l, mid, rt<<1
 #define rson            mid+1, r, rt<<1|1

 const int maxl = 3e5+;
 char M[][];
 char s[maxl];
 char d[maxl];
 int len;

 void init() {
     rep(i, , ) {
         rep(j, , ) {
             M[i][j] = (j-i+)% + '';
         }
     }
 }

 int minStr() {
     int i, j, k;
     int tmp;

     i = ;
     j = ;
     k = ;
     while (i<len && j<len && k<len) {
         tmp = d[(i+k)%len] - d[(j+k)%len];
         if (tmp == ) {
             ++k;
         } else {
             if (tmp < )
                 j += k+;
             else
                 i += k+;
             if (i == j)
                 ++j;
             k = ;
         }
     }

     return i<j ? i:j;
 }

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     int k;

     init();
     while (scanf("%s", s) != EOF) {
         len = strlen(s);
         s[len] = s[];
         rep(i, , len) {
             d[i] = M[s[i]-''][s[i+]-''];
         }
         #ifndef ONLINE_JUDGE
             d[len] = '\0';
             puts(d);
         #endif
         k = minStr();
         rep(i, , len) {
             putchar(d[(k+i)%len]);
         }
         putchar('\n');
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }