Cod sursa(job #561152)

Utilizator the@EyE@Postavaru Stefan the@EyE@ Data 18 martie 2011 22:22:09
Problema Potrivirea sirurilor Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<list>

using namespace std;

//string cuv,text;
char cuv[2000001],text[2000001];
int l[2000000],ap=0;
list<int> loc;
int n,m;

void createL()
{
	l[0]=-1;
	for(int i=1;i<n;i++)
	{
		int k=l[i-1];
		while(k>-1&&cuv[i]!=cuv[k+1])k=l[k];
		if(cuv[k+1]==cuv[i])k++;
		//k++;
		l[i]=k;
	}
}

void kmp()
{
	int k=l[0];
	for(int i=0;i<m;i++)
	{
		while(k>-1&&text[i]!=cuv[k+1])k=l[k];
		if(cuv[k+1]==text[i])k++;
		//k++;
		if(k+1==n)
		{
			ap++;
			if(loc.size()<1000)loc.push_back(i-k);
			//if(ap<=1000)loc[ap]=i-k;
			k=l[k];
		}
	}
}

int main()
{
	freopen("strmatch.in","r",stdin);
	freopen("strmatch.out","w",stdout);
	
	
	//getline(cin,cuv);
	//getline(cin,text);
	
	scanf("%s\n",cuv);
	scanf("%s\n",text);
	
	//n=cuv.size();
	//m=text.size();
	n=strlen(cuv);
	m=strlen(text);
	
	createL();
	kmp();
	
	printf("%d\n",ap);
	list<int>::iterator it;
	for(it=loc.begin();it!=loc.end();it++)printf("%d ",*it);
	//for(int i=1;i<=ap&&i<=1000;i++)printf("%d ",loc[i]);
	return 0;
}