Cod sursa(job #1241026)

Utilizator sorin2kSorin Nutu sorin2k Data 12 octombrie 2014 14:53:50
Problema Potrivirea sirurilor Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include<iostream>
#include<string>
#include<vector>
using namespace std;

int pi[2000001];
string a, b;
vector<int> ans;

// k = cate caractere am potrivit (de la 0 la k-1)
void prefix() {
	int i, k = 0;
	for(i = 1; i < a.length(); i++) {
		while(k > 0 && a[i] != a[k]) {
			k = pi[k-1];
		}
		if(a[i] == a[k]) {
			k++;
		}
		pi[i] = k;
	}
}

void match() {
	int i, k = 0;
	for(i = 0; i < b.length(); i++) {
		while(k > 0 && b[i] != a[k]) {
			k = pi[k-1];
		}
		if(b[i] == a[k]) {
			k++;
		}
		if(k == a.length()) {
			ans.push_back(i-k+1);
			k = pi[k-1];
		}
	}
}

int main() {
	freopen("strmatch.in", "r", stdin);
	freopen("strmatch.out", "w", stdout);
	int i, to;
	cin >> a >> b;
	prefix();
	match();
	printf("%d\n", ans.size());
	to = (ans.size() > 1000) ? 1000 : ans.size();
	for(i = 0; i < to; i++) {
		printf("%d ", ans[i]);
	}
	return 0;
}