<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[CloveriiW的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/CloveriiW</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; CloveriiW]]></copyright><item><title><![CDATA[重庆大学科幻协会发展史]]></title><link>https://blog.youkuaiyun.com/CloveriiW/article/details/50679693</link><guid>https://blog.youkuaiyun.com/CloveriiW/article/details/50679693</guid><author>CloveriiW</author><pubDate>Wed, 17 Feb 2016 12:39:32 +0800</pubDate><description><![CDATA[重庆大学科幻协会发展史]]></description><category></category></item><item><title><![CDATA[HDU 4302 Holedox Eating（线段树/优先队列/multiset）]]></title><link>https://blog.youkuaiyun.com/CloveriiW/article/details/48451097</link><guid>https://blog.youkuaiyun.com/CloveriiW/article/details/48451097</guid><author>CloveriiW</author><pubDate>Mon, 14 Sep 2015 23:58:23 +0800</pubDate><description><![CDATA[题意：一条线段，在某些时刻上面的某些点会随机出现蛋糕。某种动物最初在0位置，在该动物想吃蛋时，它会跑到离他最近的蛋糕那里；如果有两个蛋糕与它的距离相同，就按照上次前进的方向走。输出它走过的总路程。 
其实就是个水题，然而坑了一天，交了两页的记录 - - 写个博客纪念下]]></description><category></category></item><item><title><![CDATA[UVA 10817 Headmaster's Headache（状压DP）]]></title><link>https://blog.youkuaiyun.com/CloveriiW/article/details/48215031</link><guid>https://blog.youkuaiyun.com/CloveriiW/article/details/48215031</guid><author>CloveriiW</author><pubDate>Fri, 04 Sep 2015 22:45:33 +0800</pubDate><description><![CDATA[某校有一定数目的在职教师和求职者，给出每位教师（求职者）的工资和能教的科目集合，求所支付的最少的工资，使得每个科目都至少有两名教师可以教。在职教师不能辞退。
状压DP第一题。]]></description><category></category></item><item><title><![CDATA[头文件]]></title><link>https://blog.youkuaiyun.com/CloveriiW/article/details/48214207</link><guid>https://blog.youkuaiyun.com/CloveriiW/article/details/48214207</guid><author>CloveriiW</author><pubDate>Fri, 04 Sep 2015 22:02:02 +0800</pubDate><description><![CDATA[备个份(๑´ω`๑)
#include <algorithm>
#include <cctype>
#include <cmath>]]></description><category></category></item><item><title><![CDATA[POJ 2528 Mayor's posters（线段树染色+离散化）]]></title><link>https://blog.youkuaiyun.com/CloveriiW/article/details/48088447</link><guid>https://blog.youkuaiyun.com/CloveriiW/article/details/48088447</guid><author>CloveriiW</author><pubDate>Sat, 29 Aug 2015 16:39:31 +0800</pubDate><description><![CDATA[题目来源：POJ 
题意：在墙上贴海报，后贴的会覆盖之前的，问最后能看见几张海报
线段树染色问题，注意题目里每个数字代表一个单位长度而不是点，普通离散化会出现问题。]]></description><category></category></item></channel></rss>