<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>线段树 - 标签 - Ciel's blog</title><link>https://www.cielyang.top/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91/</link><description>线段树 - 标签 - Ciel's blog</description><generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>cielsk43@gmail.com (Ciel Yang)</managingEditor><webMaster>cielsk43@gmail.com (Ciel Yang)</webMaster><lastBuildDate>Thu, 10 Aug 2017 16:05:31 +0000</lastBuildDate><atom:link href="https://www.cielyang.top/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91/" rel="self" type="application/rss+xml"/><item><title>poj3468 A Simple Problem with Integers</title><link>https://www.cielyang.top/posts/poj3468-A-Simple-Problem-with-Integers/</link><pubDate>Thu, 10 Aug 2017 16:05:31 +0000</pubDate><author><name>Ciel Yang</name></author><guid>https://www.cielyang.top/posts/poj3468-A-Simple-Problem-with-Integers/</guid><description>本题是一道线段树的经典例题，主要考察线段树的延迟操作，难度不高，但解题思路要清晰，数据结构写法要熟练 题目描述 题目大意假设有 n 个数排成一列，且</description></item></channel></rss>