<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[userluoxuan的专栏]]></title><description><![CDATA[One AC a Day,Keep Sadness Away!]]></description><link>https://blog.youkuaiyun.com/userluoxuan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; userluoxuan]]></copyright><item><title><![CDATA[Balanced Lineup（RMQ）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38616203</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38616203</guid><author>userluoxuan</author><pubDate>Sat, 16 Aug 2014 20:19:18 +0800</pubDate><description><![CDATA[解题思路：
用RMQ求出各区间的最大最小值，]]></description><category></category></item><item><title><![CDATA[线段树模板]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38563491</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38563491</guid><author>userluoxuan</author><pubDate>Thu, 14 Aug 2014 20:21:06 +0800</pubDate><description><![CDATA[单点更新，区间求和：]]></description><category></category></item><item><title><![CDATA[Panda（线段树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38560167</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38560167</guid><author>userluoxuan</author><pubDate>Thu, 14 Aug 2014 16:19:59 +0800</pubDate><description><![CDATA[解题思路：
用每个字符的下标记录]]></description><category></category></item><item><title><![CDATA[Mayor's posters（线段树 + 离散化）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38559659</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38559659</guid><author>userluoxuan</author><pubDate>Thu, 14 Aug 2014 15:50:50 +0800</pubDate><description><![CDATA[Description


The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city coun]]></description><category></category></item><item><title><![CDATA[Crane（线段树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38558963</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38558963</guid><author>userluoxuan</author><pubDate>Thu, 14 Aug 2014 15:17:42 +0800</pubDate><description><![CDATA[Description


ACM has bought a new crane (crane -- jeřáb) . The crane consists of n segments of various lengths, connected by flexible joints. The end of the i-th segment is joined to the beginning]]></description><category></category></item><item><title><![CDATA[A Simple Problem with Integers（线段树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38558923</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38558923</guid><author>userluoxuan</author><pubDate>Thu, 14 Aug 2014 15:15:35 +0800</pubDate><description><![CDATA[解题思路：
区间更新，区间求和的模板题。
AC代码：]]></description><category></category></item><item><title><![CDATA[Coder（暴力）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38558847</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38558847</guid><author>userluoxuan</author><pubDate>Thu, 14 Aug 2014 15:10:12 +0800</pubDate><description><![CDATA[解题思路：
本来该题是应该用线段树来]]></description><category></category></item><item><title><![CDATA[Billboard（线段树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38495829</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38495829</guid><author>userluoxuan</author><pubDate>Mon, 11 Aug 2014 17:22:34 +0800</pubDate><description><![CDATA[解题思路：
题目大意是]]></description><category></category></item><item><title><![CDATA[Minimum Inversion Number（线段树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38495449</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38495449</guid><author>userluoxuan</author><pubDate>Mon, 11 Aug 2014 17:07:19 +0800</pubDate><description><![CDATA[解题思路：
用线段树求逆序对。只需要]]></description><category></category></item><item><title><![CDATA[I Hate It（线段树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38495391</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38495391</guid><author>userluoxuan</author><pubDate>Mon, 11 Aug 2014 17:05:44 +0800</pubDate><description><![CDATA[解题思路：
线段树，点更新，求]]></description><category></category></item><item><title><![CDATA[Cipher]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38456009</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38456009</guid><author>userluoxuan</author><pubDate>Sat, 09 Aug 2014 14:06:26 +0800</pubDate><description><![CDATA[Description


Bob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the sec]]></description><category></category></item><item><title><![CDATA[Goldbach's Conjecture（筛选法求素数）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38444733</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38444733</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 20:34:02 +0800</pubDate><description><![CDATA[解题思路：
筛选法求素数模板题，]]></description><category></category></item><item><title><![CDATA[中国剩余定理模板（互质版和非互质版）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38444629</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38444629</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 20:29:18 +0800</pubDate><description><![CDATA[互质版：
#include   
#include   
#include   
using namespace std;  
typedef __int64 int64;  
int64 a[15],b[15];  
  
int64 Extend_Euclid(int64 a, int64 b, int64&x, int64& y)  
{  
    if(b==0)  
    {  
]]></description><category></category></item><item><title><![CDATA[字典树模板]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38439983</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38439983</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 15:42:15 +0800</pubDate><description><![CDATA[定义一颗字典树：
struct Trie
{
    int n;  // n可以存储相关有用信息，视情况而定
    Trie *next[maxn];  //maxn视字典树中有多少种元素而定
}


定义字典树的根并初始化：
Trie *root;
void init()
{
    root = (Trie *)malloc(sizeof(Trie));
    root ->]]></description><category></category></item><item><title><![CDATA[Word Puzzles（字典树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38439545</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38439545</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 15:00:09 +0800</pubDate><description><![CDATA[Description


Word puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles printed on them, possi]]></description><category></category></item><item><title><![CDATA[IMMEDIATE DECODABILITY（字典树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38439461</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38439461</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 14:57:19 +0800</pubDate><description><![CDATA[解题思路：
这题和之前的]]></description><category></category></item><item><title><![CDATA[Babelfish(字典树 or map)]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38439233</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38439233</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 14:43:07 +0800</pubDate><description><![CDATA[解题思路：
这题用字典树做可以，用map映射做也可以，当然字典树效率]]></description><category></category></item><item><title><![CDATA[Shortest Prefixes（字典树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38437325</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38437325</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 12:06:32 +0800</pubDate><description><![CDATA[解题思路：
和前面一道]]></description><category></category></item><item><title><![CDATA[Phone List（字典树 or 排序）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38436761</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38436761</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 11:23:09 +0800</pubDate><description><![CDATA[Description

Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:
1. Emergency 911]]></description><category></category></item><item><title><![CDATA[统计难题（字典树）]]></title><link>https://blog.youkuaiyun.com/userluoxuan/article/details/38436649</link><guid>https://blog.youkuaiyun.com/userluoxuan/article/details/38436649</guid><author>userluoxuan</author><pubDate>Fri, 08 Aug 2014 11:20:53 +0800</pubDate><description><![CDATA[解题思路：
直接]]></description><category></category></item></channel></rss>