<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[No Program No Life]]></title><description><![CDATA[落寞是岁月的痕迹。]]></description><link>https://blog.youkuaiyun.com/oranges_c</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; oranges_c]]></copyright><item><title><![CDATA[【Wannafly挑战赛10】D.小H的询问(线段树的区间合并)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/79399553</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/79399553</guid><author>oranges_c</author><pubDate>Wed, 28 Feb 2018 13:50:31 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/72/D
来源：牛客网

小H给你一个数组{a}，要求支持以下两种操作：

1.  0 l r(1<=l<=r<=n)，询问区间[l,r]中权值和最大的有效子区间的权值和，一个子区间被认为是有效的当且仅当这个子区间中没有两个相邻的偶数或者奇数。

2.  1 x v(1<=x<=n,-109<=v<=109)，将a[x]的值修改为v。]]></description><category></category></item><item><title><![CDATA[后缀自动机(SAM)-模板记录/好文推荐]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/78042009</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/78042009</guid><author>oranges_c</author><pubDate>Wed, 20 Sep 2017 16:01:37 +0800</pubDate><description><![CDATA[好文推荐 
个人感觉通俗易懂。这里已hihocoder第128周为例。 
hihocoder第128周 
上面也有讲解。题意:一个字符串里有几种不同的子串 
答案:SAM所有状态的字符串数的和就是。每个状态的字符串数 = (max(s) - min(s) + 1) 
max(s):是状态s所能表示的最大字符串长度 
min(s)同理。这里记下简易模板。#include <bi]]></description><category></category></item><item><title><![CDATA[【HDU5880】Family View(AC自动机)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/78041831</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/78041831</guid><author>oranges_c</author><pubDate>Wed, 20 Sep 2017 15:50:40 +0800</pubDate><description><![CDATA[Steam is a digital distribution platform developed by Valve Corporation offering digital rights management (DRM), multiplayer gaming and social networking services. A family view can help you to prevent your ch]]></description><category></category></item><item><title><![CDATA[【HDU6183】Color it(线段树)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77800825</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77800825</guid><author>oranges_c</author><pubDate>Sat, 02 Sep 2017 13:54:47 +0800</pubDate><description><![CDATA[Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy painting, Little D asks you to write a program to maintain fol]]></description><category></category></item><item><title><![CDATA[【HDU6053】TrickGCD(莫比乌斯容斥)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77621496</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77621496</guid><author>oranges_c</author><pubDate>Sun, 27 Aug 2017 17:03:48 +0800</pubDate><description><![CDATA[You are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions?]]></description><category></category></item><item><title><![CDATA[【HDU6040】Hints of sd0061(nth_element)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77572182</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77572182</guid><author>oranges_c</author><pubDate>Fri, 25 Aug 2017 13:40:56 +0800</pubDate><description><![CDATA[sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no idea how to deal with m coming contests. sd0061 has left a set of hints for them.

There are n n]]></description><category></category></item><item><title><![CDATA[【HDU6038】Function(循环节+计数)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77571986</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77571986</guid><author>oranges_c</author><pubDate>Fri, 25 Aug 2017 13:16:17 +0800</pubDate><description><![CDATA[2017 Multi-University Training Contest - Team 1
You are given a permutation a from 0 to n−1 and a permutation b from 0 to m−1.
Define that the domain of function f is the set of integers from 0 to n−1, and the]]></description><category></category></item><item><title><![CDATA[【HDU6035】Colorful Tree(dfs,树形dp)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77571798</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77571798</guid><author>oranges_c</author><pubDate>Fri, 25 Aug 2017 12:45:32 +0800</pubDate><description><![CDATA[There is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci.

The path between each two different nodes is unique, of which we define the value as]]></description><category></category></item><item><title><![CDATA[【HDU6153】A Secret(扩展KMP)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77449604</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77449604</guid><author>oranges_c</author><pubDate>Mon, 21 Aug 2017 14:42:17 +0800</pubDate><description><![CDATA[Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS tell:
  Suffix(S2,i) =]]></description><category></category></item><item><title><![CDATA[【HDU6034】Balala Power!]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77430150</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77430150</guid><author>oranges_c</author><pubDate>Sun, 20 Aug 2017 16:44:17 +0800</pubDate><description><![CDATA[Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge them with Balala Power (he could change each character ranged from a to z into each number ranged from 0 to 25, but ea]]></description><category></category></item><item><title><![CDATA[【HDU6134】Battlestation Operational(莫比乌斯反演)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/77368867</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/77368867</guid><author>oranges_c</author><pubDate>Fri, 18 Aug 2017 13:43:10 +0800</pubDate><description><![CDATA[2017 Multi-University Training Contest - Team 8题目链接题目大意: 
让你求f(n)=∑i=1n∑j=1n⌈ij⌉[(i,j)=1]f(n) = \sum_{i = 1}^{n} \sum_{j = 1}^{n} \lceil \frac{i}{j} \rceil [(i, j) = 1]理解了q巨的解法后，对反演理解了点。。以下]]></description><category></category></item><item><title><![CDATA[【HDU6058】Kanade's sum(暴力 or 链表)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/76577514</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/76577514</guid><author>oranges_c</author><pubDate>Wed, 02 Aug 2017 15:03:02 +0800</pubDate><description><![CDATA[Give you an array A[1..n]of length n. 

Let f(l,r,k) be the k-th largest element of A[l..r].

Specially , f(l,r,k)=0 if r−l+1<k.

Give you k , you need to calculate ∑nl=1∑nr=lf(l,r,k)

There are T test cases.]]></description><category></category></item><item><title><![CDATA[【HDU6060】RXD and dividing(dfs)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/76577175</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/76577175</guid><author>oranges_c</author><pubDate>Wed, 02 Aug 2017 14:44:29 +0800</pubDate><description><![CDATA[RXD has a tree T, with the size of n. Each edge has a cost.
Define f(S) as the the cost of the minimal Steiner Tree of the set S on tree T. he wants to divide 2,3,4,5,6,…n into k parts S1,S2,S3,…Sk,
where]]></description><category></category></item><item><title><![CDATA[【loj】#6011. 「网络流 24 题」运输问题(最小费用流)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/75913421</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/75913421</guid><author>oranges_c</author><pubDate>Sun, 23 Jul 2017 16:05:52 +0800</pubDate><description><![CDATA[W 公司有 m  个仓库和 n  个零售商店。第 i 个仓库有 ai 个单位的货物；第 j 个零售商店需要 bj 个单位的货物。货物供需平衡，]]></description><category></category></item><item><title><![CDATA[【loj】#6009. 「网络流 24 题」软件补丁(状态压缩+最短路)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/75913275</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/75913275</guid><author>oranges_c</author><pubDate>Sun, 23 Jul 2017 15:59:37 +0800</pubDate><description><![CDATA[某公司发现其研制的一个软件中有 n 个错误，随即为该软件发放了一批共m 个补丁程序。每一个补丁程序都有其特定的适用环境，某个补丁只有在软件中包含某些错误而同时又不包含另一些错误时才可以使用。一个补丁在排除某些错误的同时，往往会加入另一些错误。
换句话说，对于每一个补丁 i ，都有 2 个与之相应的错误集合 B1(i) 
 和 B2(i) ，使得仅当软件包含 B1(i) 中的所有错误，，而不包含 B2(i)]]></description><category></category></item><item><title><![CDATA[【loj】#6008. 「网络流 24 题」餐巾计划(最小费用流)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/75912935</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/75912935</guid><author>oranges_c</author><pubDate>Sun, 23 Jul 2017 15:52:28 +0800</pubDate><description><![CDATA[一个餐厅在相继的 n 天里，每天需用的餐巾数不尽相同。假设第 i  天需要 ri 
​​  块餐巾。餐厅可以购买新的餐巾，每块餐巾的费用为 P  分；或者把旧餐巾送到快洗部，洗一块需 M天，其费用为 F 分；或者送到慢洗部，洗一块需 N天，其费用为 S 分（S<F）。
每天结束时，餐厅必须决定将多少块脏的餐巾送到快洗部，多少块餐巾送到慢洗部，以及多少块保存起来延期送洗。但是每天洗好的餐巾和购买的新餐巾数之和，要满足当]]></description><category></category></item><item><title><![CDATA[【POJ2125】Destroying The Graph(最小权覆盖点集)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/75666425</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/75666425</guid><author>oranges_c</author><pubDate>Fri, 21 Jul 2017 17:01:59 +0800</pubDate><description><![CDATA[Alice and Bob play the following game. First, Alice draws some directed graph with N vertices and M arcs. After that Bob tries to destroy it. In a move he may take any vertex of the graph and remove either all]]></description><category></category></item><item><title><![CDATA[【loj】#6007. 「网络流 24 题」方格取数(二分图最大点权独立集)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/75419582</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/75419582</guid><author>oranges_c</author><pubDate>Wed, 19 Jul 2017 17:07:57 +0800</pubDate><description><![CDATA[在一个有 m×n 个方格的棋盘中，每个方格中有一个正整数。

现要从方格中取数，使任意 2 个数所在方格没有公共边，且取出的数的总和最大。试设计一个满足要求的取数算法。]]></description><category></category></item><item><title><![CDATA[【loj】#6006. 「网络流 24 题」试题库(二分图匹配)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/75416602</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/75416602</guid><author>oranges_c</author><pubDate>Wed, 19 Jul 2017 16:53:00 +0800</pubDate><description><![CDATA[假设一个试题库中有 n n n 道试题。每道试题都标明了所属类别。同一道题可能有多个类别属性。现要从题库中抽取 m m m 道题组成试卷。并要求试卷包含指定类型的试题。试设计一个满足要求的组卷算法。]]></description><category></category></item><item><title><![CDATA[【loj】#6005. 「网络流 24 题」最长递增子序列(dp+最大流)]]></title><link>https://blog.youkuaiyun.com/oranges_c/article/details/75415250</link><guid>https://blog.youkuaiyun.com/oranges_c/article/details/75415250</guid><author>oranges_c</author><pubDate>Wed, 19 Jul 2017 16:49:04 +0800</pubDate><description><![CDATA[给定正整数序列 x1∼xn ，以下递增子序列均为非严格递增。
计算其最长递增子序列的长度 s。
计算从给定的序列中最多可取出多少个长度为 s 的递增子序列。
如果允许在取出的序列中多次使用 x1 和 xn ，则从给定序列中最多可取出多少个长度为 s 的递增子序列。]]></description><category></category></item></channel></rss>