最小表示法模板

 

//minRepresentation#include <stdio.h>#include <string.h>#define maxn 1000char str[2 * maxn];int len;int minR(){int i = 0, j = 1, k = 0, t;while(i + k < len && j + k < len){t = str[i + k] - str[j + k];if(t == 0) ++k;else{if(t > 0) i += k + 1;else j += k + 1;k = 0;if(j == i) ++j;}}return i < j ? i : j;}int main(){while(gets(str)){len = strlen(str);memcpy(str + len, str, len);len *= 2;printf("%d\n", minR());}return 0;}