﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-yes you do-最新评论</title><link>http://www.cppblog.com/twogreat/CommentsRSS.aspx</link><description>yes i do</description><language>zh-cn</language><pubDate>Thu, 20 Aug 2009 14:20:50 GMT</pubDate><lastBuildDate>Thu, 20 Aug 2009 14:20:50 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: PKU3468线段树入门</title><link>http://www.cppblog.com/twogreat/archive/2009/11/28/85780.html#102187</link><dc:creator>lyb</dc:creator><author>lyb</author><pubDate>Sat, 28 Nov 2009 12:16:00 GMT</pubDate><guid>http://www.cppblog.com/twogreat/archive/2009/11/28/85780.html#102187</guid><description><![CDATA[struct node<br>{<br>    int l; //左子树<br>    int r; //右子树<br>    __int64 value; //区间的初始量<br>    __int64 tsum;  //对区间的整体改变量<br>    __int64 adt;   //对区间及子区间的改变值<br>}Node[400040];<br>博主l,r值得不是左右子树吧,应该是区间的左右端点<img src ="http://www.cppblog.com/twogreat/aggbug/102187.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/twogreat/" target="_blank">lyb</a> 2009-11-28 20:16 <a href="http://www.cppblog.com/twogreat/archive/2009/11/28/85780.html#102187#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>