<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[奋斗de穷小子]]></title><description><![CDATA[人一我百！人十我万！永不放弃~~~怀着自信的心，去追逐梦想。]]></description><link>https://blog.youkuaiyun.com/qq_37533501</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_37533501]]></copyright><item><title><![CDATA[POJ-1003 Hangover]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/118651751</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/118651751</guid><author>qq_37533501</author><pubDate>Sun, 11 Jul 2021 11:04:34 +0800</pubDate><description><![CDATA[Hangover
Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 150249		Accepted: 72569
Description
How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We’re assuming ]]></description><category></category></item><item><title><![CDATA[POJ-1002 487-3279]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/118651327</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/118651327</guid><author>qq_37533501</author><pubDate>Sun, 11 Jul 2021 10:31:09 +0800</pubDate><description><![CDATA[487-3279
Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 331201		Accepted: 58635
Description
Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For e]]></description><category></category></item><item><title><![CDATA[POJ-1001 Exponentiation]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/118650152</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/118650152</guid><author>qq_37533501</author><pubDate>Sun, 11 Jul 2021 08:45:46 +0800</pubDate><description><![CDATA[Exponentiation
Time Limit: 500MS		Memory Limit: 10000K
Total Submissions: 197361		Accepted: 47168
Description
Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national ]]></description><category></category></item><item><title><![CDATA[Frequent values  RMQ]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77720421</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77720421</guid><author>qq_37533501</author><pubDate>Wed, 30 Aug 2017 18:08:44 +0800</pubDate><description><![CDATA[Frequent values


You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1
 ≤ i ≤ j ≤]]></description><category></category></item><item><title><![CDATA[Balanced Lineup  线段树 rmq 区间最值]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77720292</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77720292</guid><author>qq_37533501</author><pubDate>Wed, 30 Aug 2017 17:57:03 +0800</pubDate><description><![CDATA[Balanced Lineup


For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the ]]></description><category></category></item><item><title><![CDATA[区间最小值  LightOJ - 1082   RMQ  线段树]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77720107</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77720107</guid><author>qq_37533501</author><pubDate>Wed, 30 Aug 2017 17:49:43 +0800</pubDate><description><![CDATA[区间最小值  LightOJ
 - 1082 
Given an array with N elements, indexed from 1 to N. Now you will be given some queries in the form I J, your task is to find the minimum value from index I to J.
Input
Inp]]></description><category></category></item><item><title><![CDATA[The Water Problem  RMQ区间最大值]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77719706</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77719706</guid><author>qq_37533501</author><pubDate>Wed, 30 Aug 2017 17:38:34 +0800</pubDate><description><![CDATA[The Water Problem
Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2249    Accepted Submission(s): 1757



Problem Description
In Land ]]></description><category></category></item><item><title><![CDATA[Just a Hook  ，线段树，区间更新 ，区间求和]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77675626</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77675626</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 11:09:48 +0800</pubDate><description><![CDATA[Just a Hook
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 35004    Accepted Submission(s): 17109



Problem Description
In the game of]]></description><category></category></item><item><title><![CDATA[Minimum Inversion Number  树状数组]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77675561</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77675561</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 11:06:18 +0800</pubDate><description><![CDATA[Minimum Inversion Number
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21360    Accepted Submission(s): 12802



Problem Description
T]]></description><category></category></item><item><title><![CDATA[Billboard   线段树]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77673235</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77673235</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 10:46:20 +0800</pubDate><description><![CDATA[Billboard
Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24453    Accepted Submission(s): 10054



Problem Description
At the entrance]]></description><category></category></item><item><title><![CDATA[I Hate It   树状数组 单点更新 区间最大值]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77671947</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77671947</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 10:34:28 +0800</pubDate><description><![CDATA[I Hate It
Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 82777    Accepted Submission(s): 31815



Problem Description
很多学校流行一种比较的习惯。老师]]></description><category></category></item><item><title><![CDATA[敌兵布阵  树状数组 单点更新 区间求和]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77671730</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77671730</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 10:27:34 +0800</pubDate><description><![CDATA[敌兵布阵
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 98822    Accepted Submission(s): 41848



Problem Description
C国的死对头A国这段时间正在进行军事演习，]]></description><category></category></item><item><title><![CDATA[素数判定]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77671332</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77671332</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 10:15:55 +0800</pubDate><description><![CDATA[素数判定
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 141829    Accepted Submission(s): 50292



Problem Description
对于表达式n^2+n+41，当n在（x,]]></description><category></category></item><item><title><![CDATA[Combinations  乘法逆元]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77669531</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77669531</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 10:03:55 +0800</pubDate><description><![CDATA[G - Combinations


Given n different objects, you want to take k of them. How many ways to can do it?
For example, say there are 4 items; you want to take 2 of them. So, you can do it 6 ways.
Tak]]></description><category></category></item><item><title><![CDATA[A/B  乘法逆元]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77668668</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77668668</guid><author>qq_37533501</author><pubDate>Tue, 29 Aug 2017 09:57:19 +0800</pubDate><description><![CDATA[A/B
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6592    Accepted Submission(s): 5223



Problem Description
要求(A/B)%9973，但由于A很大，我们只给]]></description><category></category></item><item><title><![CDATA[Romantic  扩展欧几里得]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77650899</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77650899</guid><author>qq_37533501</author><pubDate>Mon, 28 Aug 2017 17:02:10 +0800</pubDate><description><![CDATA[Romantic

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 7383    Accepted Submission(s): 3119




Problem Description

The Sky is ]]></description><category></category></item><item><title><![CDATA[二分最大匹配--匈牙利算法]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77485485</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77485485</guid><author>qq_37533501</author><pubDate>Tue, 22 Aug 2017 20:17:52 +0800</pubDate><description><![CDATA[二分最大匹配--匈牙利算法



匈牙利算法是由匈牙利数学家Edmonds于1965年提出，因而得名。匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。

-------等等，看得头大？那么请看下面的版本：

通过数代人的努力，你终于赶上了剩男剩女的大潮，假设你是一位光荣的新世纪媒人，在]]></description><category></category></item><item><title><![CDATA[O(n)回文子串（Manacher）算法]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77485171</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77485171</guid><author>qq_37533501</author><pubDate>Tue, 22 Aug 2017 20:08:40 +0800</pubDate><description><![CDATA[回文子串

问题描述：
输入一个字符串，求出其中最大的回文子串。子串的含义是：在原串中连续出现的字符串片段。回文的含义是：正着看和倒着看相同，如abba和yyxyy。
 
解析：
这里介绍O(n)回文子串（Manacher）算法
算法基本要点：首先用一个非常巧妙的方式，将所有可能的奇数/偶数长度的回文子串都转换成了奇数长度：在每个字符的两边都插入一个特殊的符号。比如 abba 变成]]></description><category></category></item><item><title><![CDATA[Balanced Lineup  线段树  RMQ]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77483116</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77483116</guid><author>qq_37533501</author><pubDate>Tue, 22 Aug 2017 17:31:06 +0800</pubDate><description><![CDATA[Balanced Lineup




Time Limit: 5000MS


Memory Limit: 65536K


Total Submissions: 56032


Accepted: 26268


Case Time Limit: 2000MS




Description

For the daily milking, Far]]></description><category></category></item><item><title><![CDATA[LightOJ - 1082    区间最小值  RMQ]]></title><link>https://blog.youkuaiyun.com/qq_37533501/article/details/77482195</link><guid>https://blog.youkuaiyun.com/qq_37533501/article/details/77482195</guid><author>qq_37533501</author><pubDate>Tue, 22 Aug 2017 16:42:01 +0800</pubDate><description><![CDATA[LightOJ - 1082    区间最小值
Given an array with N elements, indexed from 1 to N. Now you will be given some queries in the form I J, your task is to find the minimum value from index I to J.
Input
Inpu]]></description><category></category></item></channel></rss>