Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13036 Accepted Submission(s): 5892
Problem Description
Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], ...... , a[K + M - 1] = b[M]. If there are more than one K exist, output the smallest one.
Input
The first line of input is a number T which indicate the number of cases. Each case contains three lines. The first line is two numbers N and M (1 <= M <= 10000, 1 <= N <= 1000000). The second line contains N integers which indicate a[1], a[2], ...... , a[N]. The third line contains M integers which indicate b[1], b[2], ...... , b[M]. All integers are in the range of [-1000000, 1000000].
Output
For each test case, you should output one line which only contain K described above. If no such K exists, output -1 instead.
Sample Input
2 13 5 1 2 1 2 3 1 2 3 1 3 2 1 2 1 2 3 1 3 13 5 1 2 1 2 3 1 2 3 1 3 2 1 2 1 2 3 2 1
Sample Output
6 -1试了试模板代码#include<cstdio> #include<cstdlib> #include<cstring> #include<iostream> #include<algorithm> #include<string> #include<cmath> #include<queue> #include<map> #include<set> #define INF 0x3f3f3f3f #define mem(a,b) memset(a,b,sizeof(a)) using namespace std; const int maxd=1000000+5; const int maxn=10000+5; typedef long long ll; typedef pair<int,int> pii; //--------------------------- int a[maxd],b[maxn],n,m; vector<int> pos; void find_substring(int a[],int b[]) { vector<int> next(m+1,0); for(int i=1; i<m; ++i) { int j=i; while(j>0) { j=next[j]; if(b[j]==b[i]) { next[i+1]=j+1; break; } } } pos.clear(); for(int i=0,j=0; i<n; ++i) { if(j<m && a[i]==b[j]) ++j; else { while(j>0) { j=next[j]; if(a[i]==b[j]) { ++j; break; } } } if(j==m) pos.push_back(i-m+2); } } int main() { freopen("in.txt", "r", stdin); int kase; scanf("%d",&kase); while(kase--) { scanf("%d%d",&n,&m); for(int i=0; i<n; ++i) scanf("%d",&a[i]); for(int i=0; i<m; ++i) scanf("%d",&b[i]); find_substring(a,b); if(pos.size()) printf("%d\n",pos[0]); else printf("-1\n"); } return 0; }