Fixed building issue

liuxinyu95 · Dec 14, 2023 · cdc9a71 · cdc9a71
1 parent ee8776c
commit cdc9a71
Showing 1 changed file with 13 additions and 32 deletions.
diff --git a/search/scan/palindrome/palindrome.tex b/search/scan/palindrome/palindrome.tex
@@ -1,38 +1,19 @@
-\documentclass{article}
-
-\usepackage{subfig}
-\usepackage{tikz}
-
-\usepackage{amsmath}
-\usepackage{listings}
-\usepackage{algorithm}
-\usepackage[noend]{algpseudocode} %for pseudo code, include algorithmicsx automatically
-
-% for better Haskell code outlook
-%% \lstdefinelanguage{Haskell}{
-%%   basicstyle=\small\ttfamily,
-%%   flexiblecolumns=false,
-%%   basewidth={0.5em,0.45em},
-%%   literate={+}{{$+$}}1 {/}{{$/$}}1 {*}{{$*$}}1 {=}{{$=$}}1
-%%            {>}{{$>$}}1 {<}{{$<$}}1 {\\}{{$\lambda$}}1
-%%            {\\\\}{{\char`\\\char`\\}}1
-%%            {->}{{$\rightarrow$}}2 {>=}{{$\geq$}}2 {<-}{{$\leftarrow$}}2
-%%            {<=}{{$\leq$}}2 {=>}{{$\Rightarrow$}}2
-%%            {\ .}{{$\circ$}}2 {\ .\ }{{$\circ$}}2
-%%            {>>}{{>>}}2 {>>=}{{>>=}}2
-%%            {|}{{$\mid$}}1
-%% }[keywords,comments,strings]
-
-\lstloadlanguages{C, Haskell, Python}
-
-\lstset{
-  showstringspaces = false
-}
+\documentclass[b5paper]{article}
+\usepackage[nomarginpar
+  %, margin=.5in
+]{geometry}
+
+\addtolength{\oddsidemargin}{-0.05in}
+\addtolength{\evensidemargin}{-0.05in}
+\addtolength{\textwidth}{0.1in}
+\usepackage[en]{../../../prelude}
+
+%% \usepackage{subfig}
 
 \begin{document}
 
 \title{The longest palindrome}
-\author{Larry LIU Xinyu}
+\author{LIU Xinyu}
 \maketitle
 
 \section{The problem}
@@ -557,7 +538,7 @@ \section{Manacher's algorithm}
 Esko Ukkonen. ``On-line construction of suffix trees''. Algorithmica 14 (3): 249--260. doi:10.1007/BF01206331. \url{http://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf}
 
 \bibitem{Manacher75}
-Manacher, Glenn (1975), ``A new linear-time `on-line' algorithm for finding the smallest initial palindrome of a string'', Journal of the ACM 22 (3): 346¨C351, doi:10.1145/321892.321896
+Manacher, Glenn (1975), ``A new linear-time `on-line' algorithm for finding the smallest initial palindrome of a string'', Journal of the ACM 22 (3): 346-351, doi:10.1145/321892.321896
 
 \bibitem{wiki-longest-palindrome}
 Longest palindromic substring. Wikipedia. \url{https://en.wikipedia.org/wiki/Longest_palindromic_substring}