<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[StarlitNight的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/StarlitNight</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; StarlitNight]]></copyright><item><title><![CDATA[[TYVJ P1039] 忠诚2]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/77480841</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/77480841</guid><author>StarlitNight</author><pubDate>Tue, 22 Aug 2017 15:29:30 +0800</pubDate><description><![CDATA[Judge：http://tyvj.cn/p/1039
题意：给出一个数列，实现两个操作：1.查询某一区间的最小值 2. 更改数列中的元素。]]></description><category></category></item><item><title><![CDATA[树状数组的区间修改和区间查询模板]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/77478514</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/77478514</guid><author>StarlitNight</author><pubDate>Tue, 22 Aug 2017 12:09:55 +0800</pubDate><description><![CDATA[树状数组的区间修改和区间查询模板]]></description><category></category></item><item><title><![CDATA[[HDU 5884] Sort]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/77456746</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/77456746</guid><author>StarlitNight</author><pubDate>Mon, 21 Aug 2017 20:28:29 +0800</pubDate><description><![CDATA[Judge：http://acm.hdu.edu.cn/showproblem.php?pid=5884
题意：给出N个节点，构造一颗k叉哈夫曼树，使每个结点的权值乘以距离的和小于等于给出的和。求k的最小值。（N<=100000）]]></description><category></category></item><item><title><![CDATA[K叉哈夫曼树]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/77453295</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/77453295</guid><author>StarlitNight</author><pubDate>Mon, 21 Aug 2017 17:35:47 +0800</pubDate><description><![CDATA[K叉哈夫曼树的做法与二叉哈夫曼树相类似，只不过每次弹出的数为K个。
最关键的问题在于，当k大于2时，按照这个步骤做下去可能到最后剩下的元素少于k个，可以增加（k-1-（n-1）%（k-1））个权值为0的叶子节点作虚拟点。]]></description><category></category></item><item><title><![CDATA[逆序对的求法（树状数组）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/77430385</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/77430385</guid><author>StarlitNight</author><pubDate>Sun, 20 Aug 2017 17:06:48 +0800</pubDate><description><![CDATA[树状数组求逆序对]]></description><category></category></item><item><title><![CDATA[[UVa 11491] 奖品的价值（Erasing and Winning）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76916401</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76916401</guid><author>StarlitNight</author><pubDate>Tue, 08 Aug 2017 16:27:51 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-11491
题意：给出一个n位的整数，删除其中的d个数字，使剩下的整数尽可能大。]]></description><category></category></item><item><title><![CDATA[[UVa 1610] 聚会游戏（Party Games）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76906646</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76906646</guid><author>StarlitNight</author><pubDate>Tue, 08 Aug 2017 14:58:13 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-1610
题意：输入一些字符串，找一个长度最短的字符串（不一定是输入的字符串），使得输入的字符串中有一半小于等于该字符串，另一半大于该字符串。若有多解，输出字典序最小的解。]]></description><category></category></item><item><title><![CDATA[[UVa 11093] 环形跑道（Just Finish it up）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76844128</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76844128</guid><author>StarlitNight</author><pubDate>Mon, 07 Aug 2017 14:59:45 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-11093
题意：环形跑道上有n个加油小站，第i个加油站可以加油p1加仑，从第i站到下一站需要qi加仑汽油。选择一个起点，使得可以走完一圈回到起点。]]></description><category></category></item><item><title><![CDATA[滑动窗口问题]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76769827</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76769827</guid><author>StarlitNight</author><pubDate>Sun, 06 Aug 2017 15:06:04 +0800</pubDate><description><![CDATA[Judge：http://dsalgo.openjudge.cn/stackqueue/7/
题意：给定一个长度为n（n<=10^6）的数组。有一个大小为k的滑动窗口从数组的最左端移动到最右端。求滑动窗口在每个位置时的最大值和最小值。]]></description><category></category></item><item><title><![CDATA[[UVa 11572] 唯一的雪花（Unique Snowflakes）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76762069</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76762069</guid><author>StarlitNight</author><pubDate>Sun, 06 Aug 2017 11:35:20 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-11572
题意：在一个长度最多为10^6的序列中找到一个尽量长的、没有相同元素的连续子序列。]]></description><category></category></item><item><title><![CDATA[[UVa 1152] 和为0的四个值（4 Values whose Sum is 0）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76725401</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76725401</guid><author>StarlitNight</author><pubDate>Sat, 05 Aug 2017 16:41:35 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-1152
题意：给定4个n元素集合A，B，C，D，要求分别从中选取一个元素a，b，c，d，使得四个数之和为零。求一共有多少种选法。]]></description><category></category></item><item><title><![CDATA[[UVa 11134] 传说中的车（Fabled Rooks）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76723942</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76723942</guid><author>StarlitNight</author><pubDate>Sat, 05 Aug 2017 15:46:06 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-11134
题意：在n*n的棋盘上放n个车，使所有的车不相互攻击，输出一个解或“IMPOSSIBLE”。]]></description><category></category></item><item><title><![CDATA[如何编写对拍程序？]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76687634</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76687634</guid><author>StarlitNight</author><pubDate>Fri, 04 Aug 2017 16:30:33 +0800</pubDate><description><![CDATA[如何编写一个对拍程序来帮助查找程序的Bug。]]></description><category></category></item><item><title><![CDATA[[UVa 1572] 自组合（Self-Assembly）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76647842</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76647842</guid><author>StarlitNight</author><pubDate>Thu, 03 Aug 2017 19:47:57 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-1572

题意：
给定n种无数多个正方形，每个正方形的每条边有标号。对于两条边A+可与A-连接在一起，B+可与B-连接在一起，以此类推，但是00不能与任何边连接。
问是否存在一种连接方式可使这些正方形无限拼接下去（正方形可进行旋转和翻转）。]]></description><category></category></item><item><title><![CDATA[[UVa 12166] 修改天平（Equilibrium Mobile）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76593224</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76593224</guid><author>StarlitNight</author><pubDate>Wed, 02 Aug 2017 18:25:42 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-12166
题意：给一棵深度不超过16的二叉树，代表一个天平。每根杆都悬挂在中间，每个秤砣的重量已知。至少需要修改多少个秤砣的重量才能使天平平衡？]]></description><category></category></item><item><title><![CDATA[[UVa 712] S 树（S-Trees）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76588660</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76588660</guid><author>StarlitNight</author><pubDate>Wed, 02 Aug 2017 17:34:29 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-712
题意：给定一棵满二叉树的叶节点的值，求每个查询到达的叶子的值。查询从根节点开始，0表示向左走，1表示向右走。]]></description><category></category></item><item><title><![CDATA[[UVa 673] 平衡的括号（Parentheses Balance）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76584548</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76584548</guid><author>StarlitNight</author><pubDate>Wed, 02 Aug 2017 16:39:17 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-673]]></description><category></category></item><item><title><![CDATA[[UVa 816] Abbott 的复仇（Abbott's Revenge）]]></title><link>https://blog.youkuaiyun.com/StarlitNight/article/details/76560281</link><guid>https://blog.youkuaiyun.com/StarlitNight/article/details/76560281</guid><author>StarlitNight</author><pubDate>Tue, 01 Aug 2017 22:26:03 +0800</pubDate><description><![CDATA[Judge：https://vjudge.net/problem/UVA-816
题意：一个迷宫，每个点限制了从哪一方向（东西南北）来的，只能往左右前走，然后问起点到终点的最短路径。]]></description><category></category></item></channel></rss>