https://www.cheasim.com/categories/%E7%BA%BF%E6%AE%B5%E6%A0%91/ Recent content in 线段树 on CheaSim Blog Hugo zh-cn Fri, 21 Sep 2018 00:00:00 +0000 https://www.cheasim.com/2018/09/21/codeforces-833b-the-bakery/ Fri, 21 Sep 2018 00:00:00 +0000 https://www.cheasim.com/2018/09/21/codeforces-833b-the-bakery/ <h1 id="codeforces-833b---the-bakery">Codeforces 833B - The Bakery</h1> <h2 id="题意">题意</h2> <p>将一段数字分成最多50个区间，每个区间的价值是区间内不同数字的个数，问怎么样分区间使得价值总和最大。</p> <h2 id="题解">题解</h2> <p>$dp$加线段树。</p> <p>$dp[i][j]$表示第$j$个坐标分成$i$块最大的价值。</p> https://www.cheasim.com/2018/09/07/hdoj4614-vases-and-flowers/ Fri, 07 Sep 2018 00:00:00 +0000 https://www.cheasim.com/2018/09/07/hdoj4614-vases-and-flowers/ <h1 id="vases-and-flowers">Vases and Flowers</h1> <h2 id="题意">题意</h2> <p>Alice去一排$n$的花盆中种花，有两种操作</p> <ul> <li> <p>从$a$开始种花，如果该花盆有花就跳到下一个花盆。直到没有花种或者到了$n$盆</p> </li> <li> <p>$[a,b]$区间的所有花都扔掉。</p>