The necklace should be made of glass beads of different sizes connected to each other but without any thread running through the beads, so that means the beads can be disconnected at any point. The actress chose the succession of beads she wants to have and the IBM promised to make the necklace. But then he realized a problem. The joint between two neighbouring beads is not very robust so it is possible that the necklace will get torn by its own weight. The situation becomes even worse when the necklace is disjoined. Moreover, the point of disconnection is very important. If there are small beads at the beginning, the possibility of tearing is much higher than if there were large beads. IBM wants to test the robustness of a necklace so he needs a program that will be able to determine the worst possible point of disjoining the beads.
The description of the necklace is a string A = a1a2 ... am specifying sizes of the particular beads, where the last character am is considered to precede character a1 in circular fashion.
The disjoint point i is said to be worse than the disjoint point j if and only if the string aiai+1 ... ana1 ... ai-1 is lexicografically smaller than the string ajaj+1 ... ana1 ... aj-1. String a1a2 ... an is lexicografically smaller than the string b1b2 ... bn if and only if there exists an integer i, i <= n, so that aj=bj, for each j, 1 <= j < i and ai < bi
4 helloworld amandamanda dontcallmebfu aaabaaa
10 11 65
题意:给你一个串,但这个串是环型的(即实际是首尾相连的),让你确定从哪个位置断开得到的字符串的字典序最小
思路:直接用字符串最小表示法即可:详解链接http://blog.csdn.net/tianyuhang123/article/details/54919715
ac代码:
#include <iostream> #include <cstdio> #include <cstring> using namespace std; int MinimumRepresentation(char *s, int l) { int i = 0, j = 1, k = 0, t; while(i < l && j < l && k < l) { t = s[(i + k)%l] - s[(j + k)%l]; if(!t) k++; else { if(t > 0) i = i + k + 1; else j = j + k + 1; if(i == j) ++ j; k = 0; } } return (i < j ? i : j); } int main() { int x; char a[1000000]; scanf("%d",&x); getchar(); while(x--) { gets(a); int len=strlen(a); int d=MinimumRepresentation(a,len); printf("%d\n",d+1); } return 0; }