WiwiHo 的競程筆記
===
- [說明與目錄](/@wiwiho/ryjHQtWLH)
基本知識
---
- [複雜度分析](/@wiwiho/CPN-complexity)
\- 小技巧
---
- [前置處理器](/@wiwiho/CPN-preprocessor)
\- 輸入/輸出流
---
- [I/O Stream 概述](/@wiwiho/CPN-iostream)
- [I/O Stream 的控制](/@wiwiho/CPN-io-control)
- [StringStream](/@wiwiho/CPN-stringstream)
- [I/O 優化](/@wiwiho/CPN-io-optimization)
資料儲存
---
\- 數字儲存與位元運算
---
- [進位制轉換](/@wiwiho/CPN-radix-convert)
- [整數的儲存](/@wiwiho/CPN-integer-type)
- [小數的儲存](/@wiwiho/CPN-float-type)
- [位元運算](/@wiwiho/CPN-bitwise-operator)
\- 資料結構
---
- [動態陣列](/@wiwiho/CPN-dynamic-array)
- [鏈結串列 Linked List](/@wiwiho/CPN-linked-list)
- [堆疊 Stack](/@wiwiho/CPN-stack)
- [佇列 Queue](/@wiwiho/CPN-queue)
演算法設計
---
\- 動態規劃
---
- [Aliens 優化](/@wiwiho/CPN-aliens)
序列問題
---
\- 序列與區間操作
---
- [區間問題概述](/@wiwiho/CPN-range-query)
- [分塊法](/@wiwiho/CPN-sqrt-decomposition)
- [稀疏表 Sparse Table](/@wiwiho/CPN-sparse-table)
- [線段樹 Segment Tree](/@wiwiho/CPN-segment-tree)
- [樹狀數組 Binary Indexed Tree(Fenwick Tree)](/@wiwiho/CPN-binary-indexed-tree)
- [莫隊算法 Mo's Algorithm](/@wiwiho/CPN-mo-algorithm)
\- 字串 String
---
- [最長迴文子字串](/@wiwiho/CPN-lps)
圖論
---
數學
---
\- 計算幾何 Computational Geometry
---
- [向量](/@wiwiho/CPN-vector)
- [向量應用](/@wiwiho/CPN-vector-application)
- [凸包](/@wiwiho/CPN-convex-hull)
- [旋轉卡尺](/@wiwiho/CPN-rotating-caliper)
###### tags: `Competitive Programming Note`
{"metaMigratedAt":"2023-06-14T23:53:47.434Z","metaMigratedFrom":"Content","title":"WiwiHo 的競程筆記","breaks":true,"contributors":"[{\"id\":\"02353542-5acb-4a66-abd0-128b1af24abb\",\"add\":3256,\"del\":1911}]"}