<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[mowayao的专栏]]></title><description><![CDATA[为了再一次的遇见]]></description><link>https://blog.youkuaiyun.com/mowayao</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mowayao]]></copyright><item><title><![CDATA[换窝了。。。http://yaozeping.com]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/41312533</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/41312533</guid><author>mowayao</author><pubDate>Thu, 20 Nov 2014 14:25:45 +0800</pubDate><description><![CDATA[rt]]></description><category></category></item><item><title><![CDATA[Ural 1309 Dispute (递推)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/40952321</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/40952321</guid><author>mowayao</author><pubDate>Sun, 09 Nov 2014 19:27:58 +0800</pubDate><description><![CDATA[题意：
给你一个数列：
f(0) = 0
f(n) = g(n,f(n-1))
g(x,y) = ((y-1)*x^5+x^3-xy+3x+7y)%9973
让你求f(n)  n 


思路：
令m = 9973
容易观察g(x,y) = g(x%m,y)
f(x+m) = g( (x+m) %m , f(x+m-1))........
可以得到 f(x+m) = (A*f]]></description><category></category></item><item><title><![CDATA[UVa 12683 Odd and Even Zeroes（数论+数位DP）]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/40264211</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/40264211</guid><author>mowayao</author><pubDate>Sun, 19 Oct 2014 17:37:42 +0800</pubDate><description><![CDATA[UVa 12683 Odd and Even Zeroes（数论+数位DP）]]></description><category></category></item><item><title><![CDATA[UVa 12716  GCD XOR （简单证明）]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/40110075</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/40110075</guid><author>mowayao</author><pubDate>Wed, 15 Oct 2014 14:19:28 +0800</pubDate><description><![CDATA[题意： 问 gcd(i,j) = i ^ j  的对数（j 
思路：容易想到  形如  （2,3） （4,5）.....这种互质相邻且二进制位数相同的数一定满足要求。
那么对于gcd为2情况进行分析：
从gcd(a,b) = 2得到a/2,b/2互质，可以想到a/2与b/2相差只能是1，因为要使a^b = 2 a,b只有在第1位有差别，即差别为2，如果a/2与b/2相差超过1，那么a,b就不]]></description><category></category></item><item><title><![CDATA[UVa 12715  Watching the Kangaroo(二分)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/40074971</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/40074971</guid><author>mowayao</author><pubDate>Tue, 14 Oct 2014 12:29:22 +0800</pubDate><description><![CDATA[UVa 12715  Watching the Kangaroo(二分)]]></description><category></category></item><item><title><![CDATA[UVa 12587 Reduce the Maintenance Cost（Tarjan + 二分 + DFS）]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/40016949</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/40016949</guid><author>mowayao</author><pubDate>Sun, 12 Oct 2014 12:30:43 +0800</pubDate><description><![CDATA[题意：n个城市(n 
思路：首先边的费用可以通过Tarjan求桥之后求得(利用桥的性质)，然后就是二分答案了！对于每个点，如果有个儿子不能维护，那么不可行，否则，试着让儿子去维护边权，如果不可行，只能让父亲承担。
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
u]]></description><category></category></item><item><title><![CDATA[UVa 12585 Poker End Games]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39992189</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39992189</guid><author>mowayao</author><pubDate>Sat, 11 Oct 2014 12:30:30 +0800</pubDate><description><![CDATA[题意：Alice和Bob这对狗男女又开始玩游戏了！！！！一开始前者有a元，后者有b元，每次玩，每个人赢得概率是对半开的，令c为a,b中的最小值，那么每次玩，谁输了就给赢的人c元，问Alice赢的概率和游戏的盘数期望值！
思路：貌似会迭代！公式也不好推。。。发现概率是0.5  然后误差范围是1e-5， 那么只要到达一定深度以后概率就可以忽略不计了！
    #include 
#include ]]></description><category></category></item><item><title><![CDATA[UVa 12589 Learning Vector]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39992103</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39992103</guid><author>mowayao</author><pubDate>Sat, 11 Oct 2014 12:23:31 +0800</pubDate><description><![CDATA[题意：有n个向量（0 
思路：先确定一点，对于选出的k个向量，按斜率从大到小的顺序摆放，面积最大。（不然会损失几个平行四边形的面积） 然后DP ， DP[id][cur][height] 分别表示前id个向量，已经选出了cur个向量，高度为height的最大面积。面积计算公式为  x0*y0 + 2*x1*y0+x1*y1 + 2*x2*(y0+y1)........用记忆化搜索注意初始化的优化]]></description><category></category></item><item><title><![CDATA[HDU 5047 Sawtooth(有趣的思维题+证明)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39668289</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39668289</guid><author>mowayao</author><pubDate>Mon, 29 Sep 2014 13:41:22 +0800</pubDate><description><![CDATA[Sawtooth
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 979    Accepted Submission(s): 375



Problem Description

Think about a plane]]></description><category></category></item><item><title><![CDATA[HDU 5033 Building(类凸包+向量叉积的应用)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39524007</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39524007</guid><author>mowayao</author><pubDate>Wed, 24 Sep 2014 15:54:58 +0800</pubDate><description><![CDATA[HDU 5033 类凸包]]></description><category></category></item><item><title><![CDATA[HDU 5017 Ellipsoid(模拟退火)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39498805</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39498805</guid><author>mowayao</author><pubDate>Tue, 23 Sep 2014 15:12:34 +0800</pubDate><description><![CDATA[Ellipsoid
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1015    Accepted Submission(s): 359
Special Judge


Problem Description

Give]]></description><category></category></item><item><title><![CDATA[HDU 5027 Help!(三分+圆与线段的交点)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39497505</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39497505</guid><author>mowayao</author><pubDate>Tue, 23 Sep 2014 14:12:18 +0800</pubDate><description><![CDATA[Help!
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 180    Accepted Submission(s): 32



Problem Description

“Help! Help!”

While ]]></description><category></category></item><item><title><![CDATA[SGU 120 Archipelago (简单几何)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39343169</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39343169</guid><author>mowayao</author><pubDate>Wed, 17 Sep 2014 15:17:09 +0800</pubDate><description><![CDATA[120. Archipelago

time limit per test: 0.25 sec. 
memory limit per test: 4096 KB

Archipelago Ber-Islands consists of N islands that are vertices of equiangular and equilateral N-gon. Islands are]]></description><category></category></item><item><title><![CDATA[SPOJ 417 The lazy programmer(贪心)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39317521</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39317521</guid><author>mowayao</author><pubDate>Tue, 16 Sep 2014 15:07:25 +0800</pubDate><description><![CDATA[417. The lazy programmer
Problem code: LAZYPROG









A new web-design studio, called SMART (Simply Masters of ART), employs two people. The first one is a web-designer and an executive ]]></description><category></category></item><item><title><![CDATA[HDU 4286 Data Handler (双端队列)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39235649</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39235649</guid><author>mowayao</author><pubDate>Fri, 12 Sep 2014 21:47:49 +0800</pubDate><description><![CDATA[Data Handler
Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2455    Accepted Submission(s): 616



Problem Description

　　You are in]]></description><category></category></item><item><title><![CDATA[SGU 271 Book Pile（双端队列）]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39232821</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39232821</guid><author>mowayao</author><pubDate>Fri, 12 Sep 2014 17:37:13 +0800</pubDate><description><![CDATA[271. Book Pile


time limit per test: 0.25 sec.
memory limit per test: 65536 KB

input: standard
output: standard




There is a pile of N books on the table. Two types of operations are p]]></description><category></category></item><item><title><![CDATA[POJ2103 Jackpot(容斥+高精度)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39049395</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39049395</guid><author>mowayao</author><pubDate>Thu, 04 Sep 2014 10:53:32 +0800</pubDate><description><![CDATA[Jackpot




Time Limit: 20000MS
 
Memory Limit: 64000K


Total Submissions: 1044
 
Accepted: 216


Case Time Limit: 2000MS




Description

The Great Dodgers company has recently]]></description><category></category></item><item><title><![CDATA[HDU4064 Carcassonne(状态压缩DP)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39031027</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39031027</guid><author>mowayao</author><pubDate>Wed, 03 Sep 2014 18:34:34 +0800</pubDate><description><![CDATA[HDU4064 Carcassonne(状态压缩DP)]]></description><category></category></item><item><title><![CDATA[HDU4288-Coder(线段树+离线+离散化)]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/39026247</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/39026247</guid><author>mowayao</author><pubDate>Wed, 03 Sep 2014 13:19:22 +0800</pubDate><description><![CDATA[Coder
Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3183    Accepted Submission(s): 1254



Problem Description

　　In mathematics a]]></description><category></category></item><item><title><![CDATA[POJ2185-Milking Grid（KMP，next数组的应用）]]></title><link>https://blog.youkuaiyun.com/mowayao/article/details/38983747</link><guid>https://blog.youkuaiyun.com/mowayao/article/details/38983747</guid><author>mowayao</author><pubDate>Mon, 01 Sep 2014 18:39:57 +0800</pubDate><description><![CDATA[Milking Grid




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 6317
 
Accepted: 2648




Description

Every morning when they are milked, the Farmer John's cows for]]></description><category></category></item></channel></rss>