<?xml version="1.0" encoding="UTF-8"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"><url><loc>https://notes.lopz.cloud/</loc></url><url><loc>https://notes.lopz.cloud/lectures/prefix-difference/</loc></url><url><loc>https://notes.lopz.cloud/lectures/discretization/</loc></url><url><loc>https://notes.lopz.cloud/lectures/sorting/</loc></url><url><loc>https://notes.lopz.cloud/lectures/binary-answer/</loc></url><url><loc>https://notes.lopz.cloud/lectures/two-pointers/</loc></url><url><loc>https://notes.lopz.cloud/lectures/greedy-heap/</loc></url><url><loc>https://notes.lopz.cloud/lectures/regret-greedy/</loc></url><url><loc>https://notes.lopz.cloud/lectures/search/</loc></url><url><loc>https://notes.lopz.cloud/lectures/divide-conquer/</loc></url><url><loc>https://notes.lopz.cloud/lectures/binary-lifting/</loc></url><url><loc>https://notes.lopz.cloud/lectures/set-map/</loc></url><url><loc>https://notes.lopz.cloud/lectures/monotonic-stack/</loc></url><url><loc>https://notes.lopz.cloud/lectures/monotonic-queue/</loc></url><url><loc>https://notes.lopz.cloud/lectures/sparse-table/</loc></url><url><loc>https://notes.lopz.cloud/lectures/fenwick/</loc></url><url><loc>https://notes.lopz.cloud/lectures/segment-tree/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dsu/</loc></url><url><loc>https://notes.lopz.cloud/lectures/bitset/</loc></url><url><loc>https://notes.lopz.cloud/lectures/balanced-tree/</loc></url><url><loc>https://notes.lopz.cloud/lectures/offline-sweep/</loc></url><url><loc>https://notes.lopz.cloud/lectures/string-hash/</loc></url><url><loc>https://notes.lopz.cloud/lectures/trie/</loc></url><url><loc>https://notes.lopz.cloud/lectures/kmp/</loc></url><url><loc>https://notes.lopz.cloud/lectures/manacher/</loc></url><url><loc>https://notes.lopz.cloud/lectures/xor-trie/</loc></url><url><loc>https://notes.lopz.cloud/lectures/tree-toolkit/</loc></url><url><loc>https://notes.lopz.cloud/lectures/tree-shape/</loc></url><url><loc>https://notes.lopz.cloud/lectures/cartesian-tree/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dag/</loc></url><url><loc>https://notes.lopz.cloud/lectures/shortest-path/</loc></url><url><loc>https://notes.lopz.cloud/lectures/01-bfs/</loc></url><url><loc>https://notes.lopz.cloud/lectures/second-shortest/</loc></url><url><loc>https://notes.lopz.cloud/lectures/mst-kruskal/</loc></url><url><loc>https://notes.lopz.cloud/lectures/mst-overview/</loc></url><url><loc>https://notes.lopz.cloud/lectures/scc-core/</loc></url><url><loc>https://notes.lopz.cloud/lectures/scc-expanded/</loc></url><url><loc>https://notes.lopz.cloud/lectures/biconnected/</loc></url><url><loc>https://notes.lopz.cloud/lectures/euler-path/</loc></url><url><loc>https://notes.lopz.cloud/lectures/bipartite/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dp-basic/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dp-overview/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dp-tree/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dp-tree-knapsack/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dp-state/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dp-digit/</loc></url><url><loc>https://notes.lopz.cloud/lectures/dp-optimization/</loc></url><url><loc>https://notes.lopz.cloud/lectures/math-basic/</loc></url><url><loc>https://notes.lopz.cloud/lectures/number-tools/</loc></url><url><loc>https://notes.lopz.cloud/lectures/crt/</loc></url><url><loc>https://notes.lopz.cloud/lectures/math-counting/</loc></url><url><loc>https://notes.lopz.cloud/lectures/counting-more/</loc></url><url><loc>https://notes.lopz.cloud/lectures/matrix/</loc></url><url><loc>https://notes.lopz.cloud/lectures/gaussian-elimination/</loc></url><url><loc>https://notes.lopz.cloud/lectures/contest-modeling/</loc></url></urlset>