<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Tiw的博客小家~]]></title><description><![CDATA[梦想与希望使你我充满了决心~]]></description><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Tiw_Air_Op1721]]></copyright><item><title><![CDATA[【CodeForces - 1080F】Katya and Segments Sets]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84455203</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84455203</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 24 Nov 2018 23:48:13 +0800</pubDate><description><![CDATA[@Katya and Segments Sets@@Desciption@@Translation@@Solution@@Code@@End@

@Desciption@
It is a very important day for Katya. She has a test in a programming class. As always, she was given an interesti...]]></description><category></category></item><item><title><![CDATA[【CodeForces - 1080D】Olya and magical square]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84454136</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84454136</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 24 Nov 2018 22:13:23 +0800</pubDate><description><![CDATA[@Olya and magical square@@Description@@Translation@@Solution@@Code@@End@

@Description@
Recently, Olya received a magical square with the size of 2n×2n.
It seems to her sister that one square is borin...]]></description><category></category></item><item><title><![CDATA[【CodeForces - 1080C】Masha and two friends]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84453594</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84453594</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 24 Nov 2018 21:30:51 +0800</pubDate><description><![CDATA[@Masha and two friends@@Description@@Translation@@Solution@@Code@@End@

@Description@
Recently, Masha was presented with a chessboard with a height of n and a width of m.
The rows on the chessboard ar...]]></description><category></category></item><item><title><![CDATA[【CodeForces - 1080E】Sonya and Matrix Beauty]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84453067</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84453067</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 24 Nov 2018 21:06:25 +0800</pubDate><description><![CDATA[@Sonya and Matrix Beauty@@Description - English@@Translation@@Solution@@Code@@end@

@Description - English@
Sonya had a birthday recently. She was presented with the matrix of size n×m and consist of ...]]></description><category></category></item><item><title><![CDATA[【NOIP2018】D2T2 填数游戏]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84317249</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84317249</guid><author>Tiw_Air_Op1721</author><pubDate>Wed, 21 Nov 2018 14:03:15 +0800</pubDate><description><![CDATA[@填数游戏@@题目描述@@题解@@代码@

@题目描述@
小 D 特别喜欢玩游戏。这一天，他在玩一款填数游戏。
这个填数游戏的棋盘是一个 n×m 的矩形表格。玩家需要在表格的每个格子中填入一个数字（数字 0 或者数字 1 ），填数时需要满足一些限制。
下面我们来具体描述这些限制。
为了方便描述，我们先给出一些定义：
我们用每个格子的行列坐标来表示一个格子，即（行坐标，列坐标）。（注意： 行列坐标均...]]></description><category></category></item><item><title><![CDATA[【NOIP2018】D2T1 旅行]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84317085</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84317085</guid><author>Tiw_Air_Op1721</author><pubDate>Wed, 21 Nov 2018 12:53:23 +0800</pubDate><description><![CDATA[@旅行@@题目描述@@题解@@代码@@end@

@题目描述@
小 Y 是一个爱好旅行的 OIer。她来到 X 国，打算将各个城市都玩一遍。
小Y了解到， X国的 n 个城市之间有 m 条双向道路。每条双向道路连接两个城市。 不存在两条连接同一对城市的道路，也不存在一条连接一个城市和它本身的道路。并且， 从任意一个城市出发，通过这些道路都可以到达任意一个其他城市。小 Y 只能通过这些道路从一个城市...]]></description><category></category></item><item><title><![CDATA[【NOIP2018】D1T3 赛道修建]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84311475</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84311475</guid><author>Tiw_Air_Op1721</author><pubDate>Tue, 20 Nov 2018 23:18:11 +0800</pubDate><description><![CDATA[@赛道修建@@题目描述@@题解@@代码@@end@

@题目描述@
C 城将要举办一系列的赛车比赛。在比赛前，需要在城内修建 m 条赛道。
C 城一共有 n 个路口，这些路口编号为 1,2,…,n，有 n−1 条适合于修建赛道的双向通行的道路，每条道路连接着两个路口。其中，第 ii 条道路连接的两个路口编号为 ai 和 bi，该道路的长度为 li 。借助这 n-1 条道路，从任何一个路口出发都能到...]]></description><category></category></item><item><title><![CDATA[【NOIP2018】D1T1 铺设道路]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84297102</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84297102</guid><author>Tiw_Air_Op1721</author><pubDate>Tue, 20 Nov 2018 13:43:26 +0800</pubDate><description><![CDATA[@铺设道路@@题目描述@@考场上的思路@@比较正常的题解@@end@

@题目描述@
春春是一名道路工程师，负责铺设一条长度为 n 的道路。
铺设道路的主要工作是填平下陷的地表。整段道路可以看作是 n 块首尾相连的区域，一开始，第 i 块区域下陷的深度为 di。
春春每天可以选择一段连续区间 [L,R]，填充这段区间中的每块区域，让其下陷深度减少 1。在选择区间时，需要保证，区间内的每块区域在填充...]]></description><category></category></item><item><title><![CDATA[【NOIP2018普及组】对称二叉树]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84190921</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84190921</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 17 Nov 2018 17:51:52 +0800</pubDate><description><![CDATA[@对称二叉树@@题目描述@@题解@@代码@@end@

@题目描述@
一棵有点权的有根树如果满足以下条件，则被轩轩称为对称二叉树：

二叉树；
将这棵树所有节点的左右子树交换，新树和原树对应位置的结构相同且点权相等。

下图中节点内的数字为权值，节点外的 id 表示节点编号。

现在给出一棵二叉树，希望你找出它的一棵子树，该子树为对称二叉树，且节点数最多。请输出这棵子树的节点数。
注意：只有树根的...]]></description><category></category></item><item><title><![CDATA[【NOIP2018普及组】摆渡车]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84189522</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84189522</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 17 Nov 2018 16:31:21 +0800</pubDate><description><![CDATA[@摆渡车@@[toc](@摆渡车@)@题目描述@@绝对不可能不是官方的题解@@代码@@End@
@题目描述@
有 n 名同学要乘坐摆渡车从人大附中前往人民大学，第 i 位同学在第 ti 分钟去等车。只有一辆摆渡车在工作，但摆渡车容量可以视为无限大。摆渡车从人大附中出发、把车上的同学送到人民大学、再回到人大附中（去接其他同学），这样往返一趟总共花费 m 分钟（同学上下车时间忽略不计）。摆渡车要将所有...]]></description><category></category></item><item><title><![CDATA[【Atcoder - AGC002D】Stamp Rally]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84189209</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84189209</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 17 Nov 2018 15:27:53 +0800</pubDate><description><![CDATA[@Stamp Rally@@Problem Statement@@Translation@@Solution@@Knowledge@@Code@@End@

@Problem Statement@
We have an undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and t...]]></description><category></category></item><item><title><![CDATA[【Atcoder - AGC003D】Anticube]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84173931</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84173931</guid><author>Tiw_Air_Op1721</author><pubDate>Sat, 17 Nov 2018 11:19:57 +0800</pubDate><description><![CDATA[@Anticube@@Problem Statement@@Translation@@Solution@@Code@@End@

@Problem Statement@
Snuke got positive integers s1,…,sN from his mother, as a birthday present. There may be duplicate elements.
He wil...]]></description><category></category></item><item><title><![CDATA[【Atcoder - AGC004D】Teleporter]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84146538</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84146538</guid><author>Tiw_Air_Op1721</author><pubDate>Fri, 16 Nov 2018 22:08:58 +0800</pubDate><description><![CDATA[@Teleporter@@Problem Statement@@Translation@@Solution@@Code@@End@

@Problem Statement@
There are N towns in Snuke Kingdom, conveniently numbered 1 through N. Town 1 is the capital.
Each town in the ki...]]></description><category></category></item><item><title><![CDATA[【Atcoder - AGC006C】Rabbit Exercise]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84138056</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84138056</guid><author>Tiw_Air_Op1721</author><pubDate>Fri, 16 Nov 2018 21:46:50 +0800</pubDate><description><![CDATA[@Rabbit Exercise@@Problem Statement@＠Translation＠

@Problem Statement@
There are N rabbits on a number line. The rabbits are conveniently numbered 1 through N. The coordinate of the initial position o...]]></description><category></category></item><item><title><![CDATA[【Atcoder - AGC001C】Shorten Diameter]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84137726</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84137726</guid><author>Tiw_Air_Op1721</author><pubDate>Fri, 16 Nov 2018 13:40:11 +0800</pubDate><description><![CDATA[@Shorten Diameter@@Problem Statement@@Translation@@Solution@@Code@@END@

@Problem Statement@
Given an undirected tree, let the distance between vertices u and v be the number of edges on the simple pa...]]></description><category></category></item><item><title><![CDATA[【CQBZOJ - 3611】作业斯的监视]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84102708</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84102708</guid><author>Tiw_Air_Op1721</author><pubDate>Thu, 15 Nov 2018 13:58:20 +0800</pubDate><description><![CDATA[@作业斯的监视@@题目描述@@题解@@代码@@END@

@题目描述@
数学的期中考试前一天晚上，蒟蒻的YHN在教室里上晚自习。但他过于无聊于是沉迷竞赛。正当YHN同学在颓废时，虗神附体，他YY出来一个很奇葩的算法。YHN同学非常激动，想立刻把这个算法给在教室另一端的㲚同学讲。
25班的教室布局非常奇特。有n个座位，在这些座位间有m条无向边。
然而，作业斯正在讲台上坐着！她正在监视某些边，使得YH...]]></description><category></category></item><item><title><![CDATA[【CodeForces - 983D】Arkady and Rectangles]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84038246</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84038246</guid><author>Tiw_Air_Op1721</author><pubDate>Wed, 14 Nov 2018 14:07:51 +0800</pubDate><description><![CDATA[Arkady has got an infinite plane painted in color 0. Then he draws n rectangles filled with paint with sides parallel to the Cartesian coordinate axes, one after another. The color of the i-th rectang...]]></description><category></category></item><item><title><![CDATA[【CodeForces - 1025G】Company Acquisitions]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/83750688</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/83750688</guid><author>Tiw_Air_Op1721</author><pubDate>Tue, 13 Nov 2018 23:12:11 +0800</pubDate><description><![CDATA[@Company Acquisitions@@Description - English@

@Description - English@

]]></description><category></category></item><item><title><![CDATA[【NOIP2018】游记]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84027613</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84027613</guid><author>Tiw_Air_Op1721</author><pubDate>Tue, 13 Nov 2018 13:50:25 +0800</pubDate><description><![CDATA[@NOIP2018 - 游记@@零 - 前记@@壹 - 集训前@@贰 - 集训期间@@叁 - Day0@@肆 - Day1@@伍 - Day2@@陆 - 后记@@柒 - END@

@零 - 前记@
【怕被禁赛故在赛后写游记】
人生第一次参加NOIP（提高组），也是学长们最后一次参加NOIP。
莫名感慨。。。我以后也会有这样一天的吧，每一步都走在摇摆不定的独木桥上，走偏一步就是深渊。令人恐惧，而又...]]></description><category></category></item><item><title><![CDATA[@Hello, I'm Tiw.@]]></title><link>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84027539</link><guid>https://blog.youkuaiyun.com/Tiw_Air_Op1721/article/details/84027539</guid><author>Tiw_Air_Op1721</author><pubDate>Tue, 13 Nov 2018 13:47:34 +0800</pubDate><description><![CDATA[这里是 Tiw 的 csdn 啦~
来访者你好啊，很抱歉 Tiw 已经不会再用 csdn 了。满篇的广告和越来越多的营销号使得 Tiw 失去了再使用 csdn 的决心了。
Tiw 的新博客在博客园。如果大家有谁感兴趣 Tiw 的 OI 学习或者其他的一些东西，可以去 Tiw 的博客园支持一下哦~
mark 一下 Tiw 博客园的地址：https://www.cnblogs.com/Tiw-Air-OAO/。
在此感谢大家看 Tiw 的博客。]]></description><category></category></item></channel></rss>