倍增算法实现.doc

倍增算法实现.txt*一篇一篇的翻着以前的的签名,那时候的签名有多幼稚就有多么的幼稚。你连让我报复的资格都没有-〞好想某天来电显示是你的号码。好想某天你的状态是为我而写。　有些人，我们明知道是爱的，也要去放弃，因为没结局#include <algorithm>//sort #include <cstring>//memset using namespace std; const int MAX_SFX = 210000; struct Sfx { int i; int key[2]; bool operator < (const Sfx& s) const { return key[0] < s.key[0] || key[0] == s.key[0] && key[1] < s.key[1]; } }; int g_buf[MAX_SFX + 1]; Sfx g_tempSfx[2][MAX_SFX], *g_sa = g_tempSfx[0]; void cSort(Sfx* in, int n, int key, Sfx* out) { int* cnt = g_buf; memset( cnt, 0, sizeof(int) * (n + 1) ); for (int i = 0; i < n; i++) { cnt[ in[i].key[key] ]++; } for (int i = 1; i <= n; i++) { cnt[i] += cnt[i - 1]; } for (int i = n - 1; i >= 0; i--) { out[ --cnt[ in[i].key[key] ] ] = in[i]; } } //Build a suffix array from string 'text' whose length is 'len'. //write the result into global array 'g_sa'. void buildSA(char* text, int len) { Sfx *temp = g_tempSfx[1]; int* rank = g_buf; for (int i = 0; i < len; i++) { g_sa[i].i = g_sa[i].key[1] = i; g_sa[i].key[0] = text[i]; } sort(g_sa, g_sa + len); for (int i = 0; i < len; i++) { g_sa[i].key[1] = 0; } int wid = 1; while (wid < len) { rank[ g_sa[0].i ] = 1; for (int i = 1; i < len; i++) { rank[ g_sa[i].i ] = rank[ g_sa[i - 1].i ]; if ( g_sa[i-1] < g_sa[i] ) { rank[ g_sa[i].i ]++; } } for (int i = 0; i < len; i++) { g_sa[i].i = i; g_sa[i].key[0] = rank[i]; g_sa[i].key[1] = i + wid < len? rank[i + wid]: 0; } cSort(g_sa, len, 1, temp); cSort(temp, len, 0, g_sa); wid *= 2; } } int getLCP(char* a, char* b) { int l=0; while(*a && *b && *a==*b) { l++; a++; b++; } return l; } void getLCP(char* text, Sfx* sfx, int len, int* lcp) { int* rank = g_buf; for (int i=0, r=0; i < len; i++, r++) { rank[ sfx[i].i ] = r; } lcp[0] = 0; if (rank[0]) { lcp[ rank[0] ] = getLCP( text, text + sfx[ rank[0]-1 ].i )