<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:media="http://search.yahoo.com/mrss/" version="2.0"><channel><title>分类：模板 - Maochong</title><link>https://lbr.ink/categories/mo-ban</link><atom:link href="https://lbr.ink/categories/mo-ban/feed/categories/mo-ban.xml" rel="self" type="application/rss+xml"/><description>Maochong</description><generator>Halo v2.25.0</generator><language>zh-cn</language><image><url>https://lbr.ink/upload/icon-Huqp.png</url><title>分类：模板 - Maochong</title><link>https://lbr.ink/categories/mo-ban</link></image><lastBuildDate>Mon, 15 Jun 2026 11:47:15 GMT</lastBuildDate><item><title><![CDATA[计算几何板子]]></title><link>https://lbr.ink/archives/ji-suan-ji-he-ban-zi</link><description><![CDATA[<img src="https://lbr.ink/plugins/feed/assets/telemetry.gif?title=%E8%AE%A1%E7%AE%97%E5%87%A0%E4%BD%95%E6%9D%BF%E5%AD%90&amp;url=/archives/ji-suan-ji-he-ban-zi" width="1" height="1" alt="" style="opacity:0;">计算几何模板 几何 点 struct Point { double x, y; Point() : x(0), y(0) {} Point(double _x, double _y) : x(_x), y(_y) {} Point operator+(Point&amp; p]]></description><guid isPermaLink="false">/archives/ji-suan-ji-he-ban-zi</guid><dc:creator>lbr</dc:creator><category>模板</category><pubDate>Tue, 20 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[算法竞赛模板]]></title><link>https://lbr.ink/archives/suan-fa-jing-sai-mo-ban</link><description><![CDATA[<img src="https://lbr.ink/plugins/feed/assets/telemetry.gif?title=%E7%AE%97%E6%B3%95%E7%AB%9E%E8%B5%9B%E6%A8%A1%E6%9D%BF&amp;url=/archives/suan-fa-jing-sai-mo-ban" width="1" height="1" alt="" style="opacity:0;">数据结构 树状数组 //单点修改+区间查询 或 区间修改+单点查询 struct bit { int n; vector&lt;int&gt; a; bit(int _n) : n(_n) { a.assign(n + 1, 0); } void ad(i]]></description><guid isPermaLink="false">/archives/suan-fa-jing-sai-mo-ban</guid><dc:creator>lbr</dc:creator><category>模板</category><pubDate>Sun, 16 Mar 2025 00:00:00 GMT</pubDate></item></channel></rss>