字符串最小最大表示法
爆肝模式开启o( ̄▽ ̄)ブ
-
有没有想过,如何求一个字符串的最大(最小)的表示方法,以下思维是从一个字符串中,找到最大的字母所在的位置,然后拼连成最大or最小的字符串。
-
我们先从一个简单的例子谈起吧,比方说ABCD,那我可以有几种形式表示呢?
ABCD BCDA CDAB DABC
我们可以通过两个指针 X,Y来标记
其基本思路如下
令x=0,y=1
如果S[x] > S[y] x=y, y=x+1
如果S[x] < S[y] y++
如果S[x]==S[y] 设指针k,分别从x和y位置向下比较,直到S[x] != S[y]
如果S[x+k] > S[y+k] x=y,y=x+1
否则y++
返回x
但是
步子有点小,容易超时啊
这时候就应该改进了
令x=0,y=1
如果S[x] > S[y] x=y, y=x+1
如果S[x] < S[y] y++
如果S[x]==S[y] 设指针k,分别从x和y位置向下比较,直到S[x] != S[y]
如果S[x+k] > S[y+k] x=x+k
否则j++
返回x和y的小者
在比较中可以用char强制转int直接用scaII码对比,也可以单字符对比,看个人喜好了
下面用强制转码对比
//最小表示法
int get_minstring(char *s)
{
int len = strlen(s);
int i = 0, j = 1, k = 0;
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 get_maxstring(char *s)
{
int len = strlen(s);
int i = 0, j = 1, k = 0;
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);
}
上例题
String Problem
HDU-3374
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 first 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
题意
输出所给字符串的最大最小表示的起始位置和数量!
思路
我们可以用最大最小的公用模板求出位置,然后用kmp求出个数
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
#define MAXN 1000017
int Next[MAXN];
char str[MAXN];
int k;
void getNext( char T[],int len)
{
int i = 0, j = -1;
Next[0] = -1;
while(i < len)
{
if(j == -1 || T[i] == T[j])
{
i++,j++;
Next[i] = j;
}
else
j = Next[j];
}
}
int get_minstring(char *s)
{
int len = strlen(s);
int i = 0, j = 1, k = 0;
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 get_maxstring(char *s)
{
int len = strlen(s);
int i = 0, j = 1, k = 0;
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);
}
int main()
{
while(scanf("%s",str)!=EOF)
{
int len = strlen(str);
getNext(str,len);
int tt = len - Next[len];
int num = 1;
if(len%tt == 0)
{
num = len/tt;
}
int posmin = get_minstring(str);
int posmax = get_maxstring(str);
printf("%d %d %d %d\n",posmin+1,num,posmax+1,num);
}
return 0;
}
如有不对的地方欢迎指正。