<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[UntilTheEnd的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/UntilTheEnd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; UntilTheEnd]]></copyright><item><title><![CDATA[伸展树总结]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/44105505</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/44105505</guid><author>UntilTheEnd</author><pubDate>Fri, 06 Mar 2015 22:09:16 +0800</pubDate><description><![CDATA[最近做的一些Splay题及思路


BZOJ 1588
就是求一个数的前驱和后继，用Splay很简单


POJ 3468 
很经典的线段树题目，用Splay做练习懒惰标记


HDU 1890
 涉及区间翻转，注意直接以数列下标建树，对原数列排序后，直接查找，找到后删除。


HDU 3436 
很好的一道题，首先离散化，Splay
树中每个节点表示的是一段区间]]></description><category></category></item><item><title><![CDATA[UVALive 4643 Twenty Questions]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/40391821</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/40391821</guid><author>UntilTheEnd</author><pubDate>Thu, 23 Oct 2014 09:54:47 +0800</pubDate><description><![CDATA[﻿﻿

Description


Consider a closed world and a set of features that are defined for all the objects in the world. Each feature can be answered with ``yes" or ``no". Using those features, we can ]]></description><category></category></item><item><title><![CDATA[UVALive 2031 Dance Dance Revolution]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/40359155</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/40359155</guid><author>UntilTheEnd</author><pubDate>Wed, 22 Oct 2014 00:26:02 +0800</pubDate><description><![CDATA[﻿﻿

Description


Mr. White, a fat man, now is crazy about a game named ``Dance, Dance, Revolution". But his dance skill is so poor that he could not dance a dance, even if he dances arduously ev]]></description><category></category></item><item><title><![CDATA[UVA10817 状压DP+01背包思想]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/40347483</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/40347483</guid><author>UntilTheEnd</author><pubDate>Tue, 21 Oct 2014 17:04:05 +0800</pubDate><description><![CDATA[﻿﻿
Description







Problem D: Headmaster's Headache




Time limit: 2 seconds




The headmaster of Spring Field School is considering employing some new teachers for certain sub]]></description><category></category></item><item><title><![CDATA[数论+容斥原理 --hdu 上的几题]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/39527607</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/39527607</guid><author>UntilTheEnd</author><pubDate>Wed, 24 Sep 2014 20:18:30 +0800</pubDate><description><![CDATA[hdu 2841 ：此题题意是从（0,0）点]]></description><category></category></item><item><title><![CDATA[HDU 2089 不要62]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/39163677</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/39163677</guid><author>UntilTheEnd</author><pubDate>Tue, 09 Sep 2014 23:23:31 +0800</pubDate><description><![CDATA[﻿﻿
不要62
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 19750    Accepted Submission(s): 6744


Problem Description
杭州人称那些傻乎乎粘嗒嗒的人为62（音：]]></description><category></category></item><item><title><![CDATA[HDU 3001Travelling （状压DP）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38588863</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38588863</guid><author>UntilTheEnd</author><pubDate>Fri, 15 Aug 2014 18:31:20 +0800</pubDate><description><![CDATA[﻿﻿
Travelling
Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3686    Accepted Submission(s): 1151


Problem Description
After coding so]]></description><category></category></item><item><title><![CDATA[POJ 3311 Hie with the Pie (状压DP)]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38580937</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38580937</guid><author>UntilTheEnd</author><pubDate>Fri, 15 Aug 2014 10:06:16 +0800</pubDate><description><![CDATA[﻿﻿

Description


The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the de]]></description><category></category></item><item><title><![CDATA[POJ 1185 炮兵阵地（状压DP）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38561705</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38561705</guid><author>UntilTheEnd</author><pubDate>Thu, 14 Aug 2014 17:46:44 +0800</pubDate><description><![CDATA[﻿﻿

Description

司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队（山地上不能够部署炮兵部队）；一支炮兵部队在地图上的攻击范围如图中黑色区域所示：



如果在地图中的灰色所标识的平原上部署一支炮兵部队，]]></description><category></category></item><item><title><![CDATA[bzoj 1059: [ZJOI2007]矩阵游戏]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38496409</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38496409</guid><author>UntilTheEnd</author><pubDate>Mon, 11 Aug 2014 18:01:52 +0800</pubDate><description><![CDATA[﻿﻿

1059: [ZJOI2007]矩阵游戏
Time Limit: 10 Sec  Memory Limit: 
162 MB
Submit: 1962  Solved: 953
[Submit][Status]
Description

小Q是一个非常聪明的孩子，除了国际象棋，他还很喜欢玩一个电脑益智游戏——矩阵游戏。矩阵游戏在一个N*N黑白方阵进行（如同国际象棋一般，只]]></description><category></category></item><item><title><![CDATA[HDU 4349 Xiao Ming's Hope(组合数的奇偶性）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38471433</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38471433</guid><author>UntilTheEnd</author><pubDate>Sun, 10 Aug 2014 17:30:30 +0800</pubDate><description><![CDATA[﻿﻿
Xiao Ming's Hope
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1316    Accepted Submission(s): 888


Problem Description
Xiao Ming ]]></description><category></category></item><item><title><![CDATA[POJ1010 STAMPS(DFS+剪枝)]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38362183</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38362183</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 22:30:11 +0800</pubDate><description><![CDATA[﻿﻿
STAMPS




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 15892
 
Accepted: 4486




Description
Have you done any Philately lately? 

You have been hired by th]]></description><category></category></item><item><title><![CDATA[POj3414 Pots]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38362033</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38362033</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 22:22:10 +0800</pubDate><description><![CDATA[﻿﻿
Pots




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 9831
 
Accepted: 4141
 
Special Judge




Description

You are given two pots, having the volume of A a]]></description><category></category></item><item><title><![CDATA[POJ 3126 Prime Path（基础题）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361875</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361875</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 22:10:13 +0800</pubDate><description><![CDATA[﻿﻿
Prime Path




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 11288
 
Accepted: 6398




Description
The ministers of the cabinet were quite upset by the message ]]></description><category></category></item><item><title><![CDATA[POJ 1426 Find The Multiple]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361641</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361641</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 22:05:23 +0800</pubDate><description><![CDATA[﻿﻿
Find The Multiple




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 17950
 
Accepted: 7267
 
Special Judge




Description
Given a positive integer n, write a ]]></description><category></category></item><item><title><![CDATA[POJ 3278 Catch That Cow(基础题）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361509</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361509</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 21:45:22 +0800</pubDate><description><![CDATA[﻿﻿
Catch That Cow




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 46307
 
Accepted: 14516




Description

Farmer John has been informed of the location of a fug]]></description><category></category></item><item><title><![CDATA[POJ 1321 棋盘问题(基础题）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361437</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361437</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 21:37:12 +0800</pubDate><description><![CDATA[﻿﻿
棋盘问题




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 22554
 
Accepted: 11198




Description
在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编]]></description><category></category></item><item><title><![CDATA[POJ 3009Curling 2.0(基础题）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361307</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361307</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 21:29:04 +0800</pubDate><description><![CDATA[﻿﻿
Curling 2.0




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 11397
 
Accepted: 4823




Description

On Planet MM-21, after their Olympic games this year, curl]]></description><category></category></item><item><title><![CDATA[POJ 3083 Children of the Candy Corn（基础题）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361235</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361235</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 21:21:59 +0800</pubDate><description><![CDATA[﻿﻿
Children of the Candy Corn




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 9555
 
Accepted: 4143




Description
The cornfield maze is a popular Halloween trea]]></description><category></category></item><item><title><![CDATA[POJ 2488 A Knight's Journey(基础题）]]></title><link>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361169</link><guid>https://blog.youkuaiyun.com/UntilTheEnd/article/details/38361169</guid><author>UntilTheEnd</author><pubDate>Sun, 03 Aug 2014 21:14:07 +0800</pubDate><description><![CDATA[﻿﻿
A Knight's Journey




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 30467
 
Accepted: 10431




Description
Background

The knight is getting bored of seeing ]]></description><category></category></item></channel></rss>