<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[博客已搬迁到http://www.cnblogs.com/cniwoq/]]></title><description><![CDATA[博客已搬迁到http://www.cnblogs.com/cniwoq/]]></description><link>https://blog.youkuaiyun.com/lututu123</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lututu123]]></copyright><item><title><![CDATA[UVa 10881Piotr's Ants【思维】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/70948807</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/70948807</guid><author>lututu123</author><pubDate>Sat, 29 Apr 2017 14:38:54 +0800</pubDate><description><![CDATA[题目链接
对于每个蚂蚁来说，他相对于其他蚂蚁的位置是固定的，赶超前面或者被后面的赶超都是要回头的，所以，假设木棒无限长，位于第一位的永远在第一位，第二位的永远在第二位。同时每两个碰头的蚂蚁其实就是类似于交换了身份继续前进。所以，先不管他们的碰头，就让每个沿着路线继续走下去。由前面的可以知道，每个蚂蚁的最终状态的位置排列的顺序就是一开始蚂蚁的编号。
#include 
#include 
#in]]></description><category></category></item><item><title><![CDATA[light oj 1245 1245 - Harmonic Number (II)【数论】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/70832938</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/70832938</guid><author>lututu123</author><pubDate>Wed, 26 Apr 2017 21:47:13 +0800</pubDate><description><![CDATA[1245 - Harmonic Number (II)




   
PDF (English)
Statistics
Forum








Time Limit: 3 second(s)
Memory Limit: 32 MB





I was trying to solve problem '1234 - Harmonic Numbe]]></description><category></category></item><item><title><![CDATA[lightoj 1259 - Goldbach`s Conjecture【素数打表】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/70828894</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/70828894</guid><author>lututu123</author><pubDate>Wed, 26 Apr 2017 20:36:31 +0800</pubDate><description><![CDATA[1259 - Goldbach`s Conjecture




   
PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 32 MB





Goldbach's conjecture is one of the oldest unsolved]]></description><category></category></item><item><title><![CDATA[lightOj 1341Aladdin and the Flying Carpet 算数基本定理]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/70821454</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/70821454</guid><author>lututu123</author><pubDate>Wed, 26 Apr 2017 19:58:27 +0800</pubDate><description><![CDATA[1341 - Aladdin and the Flying Carpet




   
PDF (English)
Statistics
Forum








Time Limit: 3 second(s)
Memory Limit: 32 MB





It's said that Aladdin had to solve seven m]]></description><category></category></item><item><title><![CDATA[HAUT校赛  魔法宝石 暴力]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/70821381</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/70821381</guid><author>lututu123</author><pubDate>Wed, 26 Apr 2017 19:51:45 +0800</pubDate><description><![CDATA[问题 C: 魔法宝石
时间限制: 2 秒  内存限制: 64 MB
提交: 505  解决: 149
提交 状态 
题目描述

小s想要创造n种魔法宝石。小s可以用ai的魔力值创造一棵第i种魔法宝石，或是使用两个宝石合成另一种宝石（不消耗魔力值）。请你帮小s算出合成某种宝石的所需的最小花费。

输入

第一行为数据组数T（1≤T≤3）。
对于每组数据，首先一行为n,m(1≤n]]></description><category></category></item><item><title><![CDATA[天梯赛5-12 愿天下有情人都是失散多年的兄妹  【dfs】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/65450093</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/65450093</guid><author>lututu123</author><pubDate>Thu, 23 Mar 2017 22:00:30 +0800</pubDate><description><![CDATA[5-12 愿天下有情人都是失散多年的兄妹   (25分)



呵呵。大家都知道五服以内不得通婚，即两个人最近的共同祖先如果在五代以内（即本人、父母、祖父母、曾祖父母、高祖父母）则不可通婚。本题就请你帮助一对有情人判断一下，他们究竟是否可以成婚？

输入格式：

输入第一行给出一个正整数N（2 \le≤ N \le
 10^4≤10​4​​），随后N行，每行按以下格式给出一个人的]]></description><category></category></item><item><title><![CDATA[poj2718 Smallest Difference【贪心】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/62236141</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/62236141</guid><author>lututu123</author><pubDate>Wed, 15 Mar 2017 19:53:55 +0800</pubDate><description><![CDATA[Smallest Difference




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 10453
 
Accepted: 2855




Description

Given a number of distinct decimal digits, you can for]]></description><category></category></item><item><title><![CDATA[HDU problem 5635 LCP Array【思维】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/60877449</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/60877449</guid><author>lututu123</author><pubDate>Wed, 08 Mar 2017 18:03:52 +0800</pubDate><description><![CDATA[LCP Array
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1532    Accepted Submission(s): 468



Problem Description

Peter has a str]]></description><category></category></item><item><title><![CDATA[codeforces 782C Andryusha and Colored Balloons【构造】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/60773590</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/60773590</guid><author>lututu123</author><pubDate>Tue, 07 Mar 2017 18:13:21 +0800</pubDate><description><![CDATA[C. Andryusha and Colored Balloons


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Andryusha goes through a ]]></description><category></category></item><item><title><![CDATA[HDU 4278 Faulty Odometer【水题】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/60773387</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/60773387</guid><author>lututu123</author><pubDate>Tue, 07 Mar 2017 18:05:08 +0800</pubDate><description><![CDATA[Faulty Odometer
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2017    Accepted Submission(s): 1398



Problem Description

　　You are ]]></description><category></category></item><item><title><![CDATA[codeforces B. The Meeting Place Cannot Be Changed【二分】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/60592793</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/60592793</guid><author>lututu123</author><pubDate>Mon, 06 Mar 2017 20:27:39 +0800</pubDate><description><![CDATA[B. The Meeting Place Cannot Be Changed


time limit per test
5 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



The main road in Byt]]></description><category></category></item><item><title><![CDATA[POJ 3264 Balanced Lineup 【线段树】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/54428158</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/54428158</guid><author>lututu123</author><pubDate>Sat, 14 Jan 2017 18:48:21 +0800</pubDate><description><![CDATA[Balanced Lineup 
Time Limit: 5000MS      Memory Limit: 65536K 
Total Submissions: 50004        Accepted: 23434 
Case Time Limit: 2000MS 
DescriptionFor the daily milking, Farmer John’s N cows (1 ≤ N ≤]]></description><category></category></item><item><title><![CDATA[HDU 1850 - Being a Good Boy in Spring Festival【Nim博弈】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53767092</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53767092</guid><author>lututu123</author><pubDate>Tue, 20 Dec 2016 19:01:33 +0800</pubDate><description><![CDATA[Being a Good Boy in Spring Festival
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7062    Accepted Submission(s): 4276



Problem Descr]]></description><category></category></item><item><title><![CDATA[CodeForces-714C - Sonya and Queries【状压 】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53493251</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53493251</guid><author>lututu123</author><pubDate>Tue, 06 Dec 2016 21:01:17 +0800</pubDate><description><![CDATA[C - Sonya and Queries
 CodeForces - 714C 





不用字典树进行维护，直接状压用数组保存就可以了。
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include]]></description><category></category></item><item><title><![CDATA[HDU Problem 1247 Hat's Words 【字典树】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53230292</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53230292</guid><author>lututu123</author><pubDate>Sat, 19 Nov 2016 14:50:40 +0800</pubDate><description><![CDATA[Hat’s Words
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13908    Accepted Submission(s): 4987



Problem Description

A hat’s word ]]></description><category></category></item><item><title><![CDATA[HDU Problem 1754 I Hate It 【线段树】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53221374</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53221374</guid><author>lututu123</author><pubDate>Fri, 18 Nov 2016 19:16:54 +0800</pubDate><description><![CDATA[I Hate It
Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 67459    Accepted Submission(s): 26244



Problem Description

很多学校流行一种比较的习惯。]]></description><category></category></item><item><title><![CDATA[POJ   - 2182 Lost Cows【线段树】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53185404</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53185404</guid><author>lututu123</author><pubDate>Wed, 16 Nov 2016 12:54:56 +0800</pubDate><description><![CDATA[题目链接 
首先，题意比较清楚，给你n-1个数，表示从2到n，其中ai表示编号为i头牛所处位置的前面有几个的序号比他小。通过这些数据，让你输出这些牛的排列顺序。
思路：
对于最后的一头牛，他肯定是（an+1），通过这个规律，可以到这推出所有牛的顺序，你可以标记，然后暴力跑一边，但是效率不高。
这里，可以用线段树进行维护。
#include 
#include 
#include 
#in]]></description><category></category></item><item><title><![CDATA[HDU - problem 1387 Team Queue【队列】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53165223</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53165223</guid><author>lututu123</author><pubDate>Mon, 14 Nov 2016 22:09:53 +0800</pubDate><description><![CDATA[Team Queue
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1999    Accepted Submission(s): 688



Problem Description

Queues and Prior]]></description><category></category></item><item><title><![CDATA[hdu - Problem 1175 连连看 【bfs】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53142779</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53142779</guid><author>lututu123</author><pubDate>Sat, 12 Nov 2016 20:19:41 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1175
Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32089    Accepted Submission(s): 7900


]]></description><category></category></item><item><title><![CDATA[codeforces 233c Cycles【贪心】]]></title><link>https://blog.youkuaiyun.com/lututu123/article/details/53142099</link><guid>https://blog.youkuaiyun.com/lututu123/article/details/53142099</guid><author>lututu123</author><pubDate>Sat, 12 Nov 2016 18:11:50 +0800</pubDate><description><![CDATA[Cycles


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



John Doe started thinking about graphs. After some th]]></description><category></category></item></channel></rss>