Problem Description
有n个小朋友,每个小朋友手里有一些糖块,现在这些小朋友排成一排,编号是由1到n。现在给出m个数,能不能唯一的确定一对值l和r(l <= r),使得这m个数刚好是第l个小朋友到第r个小朋友手里的糖块数?
Input
首先输入一个整数n,代表有n个小朋友。下一行输入n个数,分别代表每个小朋友手里糖的数量。
之后再输入一个整数m,代表下面有m个数。下一行输入这m个数。
Output
如果能唯一的确定一对l,r的值,那么输出这两个值,否则输出-1
Example Input
5 1 2 3 4 5 3 2 3 4
Example Output
2 4
code:
#include <stdio.h>
#include <string.h>
int kmp(int s1[], int s2[], int n, int m, int x);
void get_next(int a[], int n);
int next[1000100];
int main()
{
int n, m;
int a[1000100];
int b[1000100];
scanf("%d", &n);
for(int i = 0;i<n;i++)
{
scanf("%d", &a[i]);
}
scanf("%d", &m);
for(int i = 0;i<m;i++)
{
scanf("%d", &b[i]);
}
get_next(b, n);
int flag = kmp(a, b, n, m, 0);
if(flag!=-1)
{
int k = kmp(a, b, n, m, flag);//确保唯一性
if(k == -1)
{
printf("%d %d\n", flag, flag+m-1);
}
else printf("-1\n");
}
else printf("-1\n");
}
void get_next(int s[], int n)
{
int i = 0;
next[0] = -1;
int j = -1;
while(i<n)
{
if(j == -1||s[i] == s[j])
{
i++;
j++;
next[i] = j;
}
else j = next[j];
}
}
int kmp(int s1[], int s2[], int n, int m, int x)
{
int i = x, j = 0;
//int len1 = strlen(s1), len2 = strlen(s2);
while(i<n&&j<m)
{
if(j == -1||s1[i] == s2[j])
{
i++;
j++;
}
else
{
j = next[j];
}
}
if(j>=m)
{
return i-m+1;
}
else return -1;
}
#include <string.h>
int kmp(int s1[], int s2[], int n, int m, int x);
void get_next(int a[], int n);
int next[1000100];
int main()
{
int n, m;
int a[1000100];
int b[1000100];
scanf("%d", &n);
for(int i = 0;i<n;i++)
{
scanf("%d", &a[i]);
}
scanf("%d", &m);
for(int i = 0;i<m;i++)
{
scanf("%d", &b[i]);
}
get_next(b, n);
int flag = kmp(a, b, n, m, 0);
if(flag!=-1)
{
int k = kmp(a, b, n, m, flag);//确保唯一性
if(k == -1)
{
printf("%d %d\n", flag, flag+m-1);
}
else printf("-1\n");
}
else printf("-1\n");
}
void get_next(int s[], int n)
{
int i = 0;
next[0] = -1;
int j = -1;
while(i<n)
{
if(j == -1||s[i] == s[j])
{
i++;
j++;
next[i] = j;
}
else j = next[j];
}
}
int kmp(int s1[], int s2[], int n, int m, int x)
{
int i = x, j = 0;
//int len1 = strlen(s1), len2 = strlen(s2);
while(i<n&&j<m)
{
if(j == -1||s1[i] == s2[j])
{
i++;
j++;
}
else
{
j = next[j];
}
}
if(j>=m)
{
return i-m+1;
}
else return -1;
}