POJ 1509 Glass Beads java
来源:互联网 发布:ubuntu16安装php 编辑:程序博客网 时间:2024/05/22 09:52
Glass Beads
Time Limit: 3000MS Memory Limit: 10000KTotal Submissions: 2425 Accepted: 1407
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
JAVA 暴力过!!!
import java.util.Scanner;public class Main{public static void main (String args[]){ Scanner sc=new Scanner(System.in); String s; int t, pos; t=sc.nextInt(); while ((t--)!=0) { s=sc.next(); s += s; int i , j = 0, k ; int l = s.length()/2; String[] a=new String[l]; for(i=0,k=l;i<s.length()/2;i++,k++) { a[i]=s.substring(i,k); } String min=a[0]; int b = 0; for(j=1;j<a.length;j++) { int c=min.compareTo(a[j]); if(c>0) { min=a[j]; b=j; } } System.out.println(b+1); } }}
0 0
- POJ 1509 Glass Beads java
- poj 1509 Glass Beads
- POJ 1509 Glass Beads
- POJ 1509 Glass Beads
- [POJ] 1509 Glass Beads
- poj 1509 Glass Beads
- POJ 1509Glass 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【最小表示法】
- Glass Beads - POJ 1509 最小表示法
- POJ 1509 Glass Beads 后缀自动机
- POJ 1509 Glass Beads【后缀自动机、最小表示法】
- POJ 1509 Glass Beads(字符串的最小表示法)
- POJ 1509 Glass Beads(SAM 求最小表示法)
- 位运算
- php 生成水印图片 完整过程 NFS自动同步刷新varnish缓存
- uva 253(数学)
- stdint.h
- Discuz7.2 IE和chrome等浏览器兼容性写法 杜工完全修补方案
- POJ 1509 Glass Beads java
- cocos2dx下载网络图片保存在本地
- centOS 7 修改hostname
- UIWebView的简单使用
- java web入门级开发全过程-环境搭建,开发,发布,部署,总结
- UVA 10198 Counting
- hdu 1074
- 【iOS与EV3混合机器人编程系列之五】iOS_WiFi_EV3_Library 剖析之连接EV3
- hdu 1215--七夕节