String Problem hdu 3374 最小表示法加KMP的next数组
2024-09-14 21:58:02
String Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1492 Accepted Submission(s): 662
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
abcder
aaaaaa
ababab
Sample Output
1 1 6 1
1 6 1 6
1 3 2 3
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <set>
using namespace std;
char s[];
int next[];
int get(char s[],int flag,int l)
{
int i,j,k,t;
i=k=;
j=;
while(i<l&&j<l&&k<l)
{
t=s[(i+k>=l?i+k-l:i+k)]-s[(j+k>=l?j+k-l:j+k)];
if(!t)k++;
else
{
if(!flag)
{
if(t>)i+=k+;
else j+=k+;
}
else
{
if(t<)i+=k+;
else j+=k+;
}
if(i==j)j++;
k=;
}
}
return i;
}
void getsnext(char s[],int l)
{
int i=,j=;
next[]=;
while(i<l)
{
if(j==||s[i]==s[j])
{
i++,j++;
next[i]=j;
}
else j=next[j];
}
next[l-]++;
}
int main()
{
while(~scanf("%s",s))
{
int l=strlen(s);
int minaa=get(s,,l);
int maxaa=get(s,,l);
getsnext(s,l);
cout<<minaa+<<" "<<((l%(l-next[l-]))?:l/(l-next[l-]));
cout<<" "<<maxaa+<<" ";
cout<<((l%(l-next[l-]))?:l/(l-next[l-]))<<endl;
}
}
最新文章
- lr文件下载脚本(文件参数化重命名)
- Visual Studio Code 智能提示文件
- 将C#文档注释生成.chm帮助文档
- Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3) E. Santa Claus and Tangerines
- DirectShow开发快速入门之慨述
- 嘿嘿,JAVA里第一次运行单元测试成功,立存
- thinkphp+mysql+bootstrap
- VS2015使用OSChina的git功能
- if(!!attr)是什么鬼???
- 1.iOS第一个简单APP
- easyui struts后台实现tree返回json数据
- OpenLDAP安装与配置
- MAC的VIMRC
- 关于我的PP0.1聊天软件(客户端)
- 【锋利的jQuery】中全局事件ajaxStart、ajaxStop不执行
- Robotframework-Appium系列:登录操作
- Linux下php+imagemagick支持webp格式的图片
- struts2国际化全例 错误解决
- Go断言
- Codeforces Round #517 体验记