Morris-Pratt Pattern Matching
#include #include #define OUTPUT(x) printf("%d\n", x ) void preMp(char* x, int m, int mpNext[]) { int i, j; i = 0; j = mpNext[0] = -1; while (i -1 && x[i] != x[j]) j = mpNext[j]; mpNext[++i] = ++j; } } void MP(char* x, int m, char* y, int n) { int i, j, mpNext[256]; /* Preprocessing */ preMp(x, m, mpNext); /* Searching */ i = j = 0; while (j -1 && x[i] != y[j]..
2021. 4. 24.
TS 서점
const int BLM = 100001; const int ALM = 10001; const int GLM = 21; int AN; int GN; int income[ALM]; int atop[5]; bool Amax(int a, int b) { if(income[a] != income[b]) return income[a] > income[b]; return a < b; } template void swap(T& a, T& b) { T t = a; a = b; b = t; } struct Book { int sellCnt, stock, out, bid, gid, price, acnt, aids[5]; void setBook(int nb, int ng, int np, int nc, int* ap) { s..
2021. 3. 31.
