HDU 3374 String Problem(最小表达法+kmp)
来源:互联网 发布:什么软件看电子书免费 编辑:程序博客网 时间:2024/06/06 00:53
String Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3328 Accepted Submission(s): 1372
Problem Description
Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strings:
String Rank
SKYLONG 1
KYLONGS 2
YLONGSK 3
LONGSKY 4
ONGSKYL 5
NGSKYLO 6
GSKYLON 7
and lexicographically first of them is GSKYLON, lexicographically last is YLONGSK, both of them appear only once.
Your task is easy, calculate the lexicographically fisrt string’s Rank (if there are multiple answers, choose the smallest one), its times, lexicographically last string’s Rank (if there are multiple answers, choose the smallest one), and its times also.
String Rank
SKYLONG 1
KYLONGS 2
YLONGSK 3
LONGSKY 4
ONGSKYL 5
NGSKYLO 6
GSKYLON 7
and lexicographically first of them is GSKYLON, lexicographically last is YLONGSK, both of them appear only once.
Your task is easy, calculate the lexicographically fisrt string’s Rank (if there are multiple answers, choose the smallest one), its times, lexicographically last string’s Rank (if there are multiple answers, choose the smallest one), and its times also.
Input
Each line contains one line the string S with length N (N <= 1000000) formed by lower case letters.
Output
Output four integers separated by one space, lexicographically fisrt string’s Rank (if there are multiple answers, choose the smallest one), the string’s times in the N generated strings, lexicographically last string’s Rank (if there are multiple answers, choose the smallest one), and its times also.
Sample Input
abcderaaaaaaababab
Sample Output
1 1 6 11 6 1 61 3 2 3
Author
WhereIsHeroFrom
Source
HDOJ Monthly Contest – 2010.04.04
题意:
给你一个字符串,让你求出字典序最小的同构字符串,并且求出有几个同样的。
同理在求最大的。
POINT:
最小表示法
http://blog.csdn.net/zy691357966/article/details/39854359
#include <iostream>#include <string.h>#include <stdio.h>using namespace std;const int N =1000000+88;int nxt[N];void prenxt(char s[]){ int l=strlen(s); int i=0,j; j=nxt[0]=-1; while(i<l) { while(j!=-1&&s[j]!=s[i]) j=nxt[j]; nxt[++i]=++j; }}int findmin(char s[]){ int i=0,j=1,k=0; int len=strlen(s); while(i<len&&j<len&&k<len) { int t=s[(i+k)%len]-s[(j+k)%len]; if(t==0) k++; else { if(t>0) i+=k+1; else j+=k+1; if(i==j) j++; k=0; } } return min(i,j);}int findmax(char s[]){ int i=0,j=1,k=0; int len=strlen(s); while(i<len&&j<len&&k<len) { int t=s[(i+k)%len]-s[(j+k)%len]; if(t==0) k++; else { if(t>0) j+=k+1; else i+=k+1; if(i==j) j++; k=0; } } return min(i,j);}char s[N];int ans1,ans2;int doit(int pos){ int l=strlen(s); prenxt(s); int ans=1; if(l%(l-nxt[l])==0&&nxt[l]!=0) ans=l/(l-nxt[l]); return ans;}int main(){ while(~scanf("%s",s)) { memset(nxt,0,sizeof nxt); int pos1=findmin(s); ans1=doit(pos1); int pos2=findmax(s); ans2=doit(pos2); printf("%d %d %d %d\n",pos1+1,ans1,pos2+1,ans2); }}
阅读全文
0 0
- HDU 3374 String Problem(最小表达法+kmp)
- HDU 3374String Problem(最大最小表示法+KMP)
- hdu 3374 String Problem (最小表示法+KMP)
- hdu 3374 String Problem (最小表示法+kmp next[])
- hdu 3374 String Problem 【kmp+最小(大)表示法】
- hdu 3374 String Problem(最小表示法+kmp)
- HDU 3374 String Problem(最小表示法·KMP)
- hdu 3374 String Problem (kmp+最大最小表示法)
- HDU 3374 String Problem (KMP+最大最小表示法)
- HDU 3374 String Problem(最大最小表示法+kmp)
- hdu 3374 String Problem(KMP+最大最小表示法)
- HDU 3374 String Problem(最小最大表示法+KMP)
- HDU 3374 String Problem KMP-最小最大表示法
- hdu 3374 String Problem(字符串最小最大表示法+kmp)
- 【KMP】 HDU 3374 String Problem 最小表示法
- HDU 3374 String Problem (KMP+最大最小表示)
- hdu 3374 String Problem(KMP + 最小串)
- HDU 3374 String Problem (KMP+最大最小表示)
- 学习spring-boot
- 设计模式——构建者模式
- QWebSocket连接状态码
- linux常用命令及常用快捷键
- js
- HDU 3374 String Problem(最小表达法+kmp)
- 为Android的apk应用程序文件加壳以防止反编译的教程
- JavaScript常见的排序算法(一)
- 捡金币
- 北京大学是否奇闻多?
- 浏览器F12小结
- java鬼混笔记:Hibernate:5、一对多关联(单向,双向)
- 和为S的两个数字
- ACPC Headquarters : AASTMT (Stairway to Heaven)