main.tex

\documentclass[10pt,a4paper,oneside]{book}
\usepackage{listings}
\usepackage{fontspec}
\usepackage{xeCJK}
\usepackage{xcolor}
\usepackage{graphicx}
\usepackage{fancyhdr}
\usepackage{bm}
\usepackage{geometry}
\geometry{left=2.0cm,right=2.0cm,top=2.0cm,bottom=2.0cm}
\setmonofont{Consolas}
\setsansfont{Consolas}
\pagestyle{fancy}
\setcounter{tocdepth}{4}
\setcounter{secnumdepth}{3}
\lstset{
    language    = c++,
    breaklines  = true,
    captionpos  = b,
    tabsize     = 4,
    numbers     = left,
    columns     = fullflexible,
    keepspaces  = true,
    commentstyle = \color[RGB]{0,128,0},
    keywordstyle = \color[RGB]{0,0,255},
    basicstyle   = \small\ttfamily,
    rulesepcolor = \color{red!20!green!20!blue!20},
    showstringspaces = false,
}
\title{
    \begin{center}
        \includegraphics[width=4in]{logo.png}
        \\ 
        \textbf{ICPC Template Manual}
    \end{center}
}
\author{
    \includegraphics[width=3cm]{author.png}
    \\
    \textbf{作者:贺梦杰}
}
\date{\today}

\begin{document}
    \maketitle
    \tableofcontents

    \chapter{基础}
    \include{tex/Basic/Basic}
    %基础部分

    \chapter{搜索}
    %搜索部分

    \chapter{动态规划}
    \include{tex/DynamicProgramming/BagDP}
    \include{tex/DynamicProgramming/PosDP}
    \include{tex/DynamicProgramming/TreeDP}
    \include{tex/DynamicProgramming/LIS}
    %动态规划

    \chapter{字符串}
    % TODO 字符串Hash
    \include{tex/String/Trie}
    \include{tex/String/Hash}
    \include{tex/String/KMP}
    \include{tex/String/StringDS}


    \chapter{数据结构}
    \include{tex/DataStructures/UnionFindSet}
    \include{tex/DataStructures/BinaryIndexedTree}
    \include{tex/DataStructures/SegmentTree}
    \include{tex/DataStructures/ChairmanTree}
    \include{tex/DataStructures/SegmentTreeLazy}
    \include{tex/DataStructures/MergingTree}
    \include{tex/DataStructures/Dividing_tree}
    \include{tex/DataStructures/LeftPartialTree}
    \include{tex/DataStructures/SegmentTreePractice}
    \include{tex/DataStructures/WeightSegTreeInBIT}
    \include{tex/DataStructures/Splay}
    %数据结构

    \chapter{图论}
    \include{tex/GraphTheory/ShortPath}
    %最短路
    \include{tex/GraphTheory/MST}
    %最小生成树
    \include{tex/GraphTheory/Diameter&LCA}
    %树的直径与最近公共祖先
    \include{tex/GraphTheory/OnTree}
    %树上问题
    \include{tex/GraphTheory/RingTree}
    %TODO 基环树 
    \include{tex/GraphTheory/SystemOfDifferenceConstraints}
    %负环与差分约束
    \include{tex/GraphTheory/TarjanDCC}
    %Tarjan算法与无向图连通性
    \include{tex/GraphTheory/TarjanSCC}
    %Tarjan算法与有向图连通性
    \include{tex/GraphTheory/BipartiteGraph_Match}
    %二分图的匹配
    \include{tex/GraphTheory/BipartiteGraph_Cover}
    %二分图的覆盖与独立集
    \include{tex/GraphTheory/NetworkFlowsBasic}
    %网络流初步
\end{document}