POJ 1509 最小表示法
来源:互联网 发布:萨德问题 知乎 编辑:程序博客网 时间:2024/06/05 22:30
题目:
Glass Beads
Time Limit: 3000MS Memory Limit: 10000KTotal Submissions: 4065 Accepted: 2304
Description
Once upon a time there was a famous actress. As you may expect, she played mostly Antique Comedies most of all. All the people loved her. But she was not interested in the crowds. Her big hobby were beads of any kind. Many bead makers were working for her and they manufactured new necklaces and bracelets every day. One day she called her main Inspector of Bead Makers (IBM) and told him she wanted a very long and special necklace.
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
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
Input
The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line containing necklace description. Maximal length of each description is 10000 characters. Each bead is represented by a lower-case character of the english alphabet (a--z), where a < b ... z.
Output
For each case, print exactly one line containing only one integer -- number of the bead which is the first at the worst possible disjoining, i.e.\ such i, that the string A[i] is lexicographically smallest among all the n possible disjoinings of a necklace. If there are more than one solution, print the one with the lowest i.
Sample Input
4helloworldamandamandadontcallmebfuaaabaaa
Sample Output
101165
最下表示法讲解:
http://blog.csdn.net/cclsoft/article/details/5467743
代码:
#include<iostream>#include<cstring>#include<cstdio>#include<cstdlib>#include<ctype.h> //tower()#include<set> #include<map> #include<iomanip>// cout<<setprecision(1)<<fixed<<a;#include<vector> #include<cmath>#include<algorithm>#include<bitset>#include<limits.h>#include<stack>#include<queue>using namespace std;const int maxn=10010;const int inf=0x7fffffff;int mr(char *s,int len){int i=0,j=1,cnt=0;while(i<len&&j<len&&cnt<len){if(s[(i+cnt)%len]==s[(j+cnt)%len]) cnt++;else{if(s[(i+cnt)%len]>s[(j+cnt)%len]) i=i+cnt+1;else j=j+cnt+1;if(i==j) ++j;cnt=0;}}return min(i,j);}int main(){int t;char s[maxn];scanf("%d",&t);while(t--){scanf("%s",s);printf("%d\n",mr(s,strlen(s))+1);}}
买一送一:
zoj 1729
#include<iostream>#include<cstring>#include<cstdio>#include<cstdlib>#include<ctype.h> //tower()#include<set> #include<map> #include<iomanip>// cout<<setprecision(1)<<fixed<<a;#include<vector> #include<cmath>#include<algorithm>#include<bitset>#include<limits.h>#include<stack>#include<queue>using namespace std;const int maxn=100010;const int inf=0x7fffffff;int mr(char *s,int len){int i=0,j=1,cnt=0;while(i<len&&j<len&&cnt<len){if(s[(i+cnt)%len]==s[(j+cnt)%len]) cnt++;else{if(s[(i+cnt)%len]>s[(j+cnt)%len]) i=i+cnt+1;else j=j+cnt+1;if(i==j) ++j;cnt=0;}}return min(i,j);}int main(){int t,l;char s[maxn];scanf("%d",&t);while(t--){scanf("%d%s",&l,s);printf("%d\n",mr(s,l));}}
0 0
- poj 1509 最小表示法
- POJ 1509 最小表示法
- poj 1509 字符串最小表示法
- poj 1509 Glass Beads【最小表示法】
- Glass Beads - POJ 1509 最小表示法
- POJ 1509(字符串最小表示)
- POJ 1506 最小表示法
- POJ 1509 Glass Beads【后缀自动机、最小表示法】
- POJ 1509 Glass Beads(字符串的最小表示法)
- POJ 1509 Glass Beads(SAM 求最小表示法)
- poj - 1509 - Glass Beads(最小表示法)
- poj 1509 Glass Beads (最小表示法,模板题)
- 【字符串最小表示法】 POJ 1509 Glass Beads
- POJ-1509 Glass Beads (字符串最小表示法&后缀自动机)
- POJ 1509 Glass Beads【字符串最小表示法】
- POJ 1509 Glass Beads(最小表示法)
- POJ 1509 Glass Beads(最小表示法、后缀自动机)
- poj 1509 Glass Beads(最小表示法模板题)
- 流状态
- android 中限制EditText 最大输入字符数
- java数组实现二分法查找算法
- mmap专题
- .net 基础服务开源战略规划备忘录
- POJ 1509 最小表示法
- Spring MVC + MyBatis 记录自己项目问题
- leetcode 461. Hamming Distance
- 深度感知
- JavaScript高级程序设计读书笔记(第六章)(四)
- LeetCode: 3Sum
- 【Python】学习笔记——-5.0、函数式编程
- 谈谈Android的so
- 数据结构实验之栈四:括号匹配