<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hqf1992的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hqf1992</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hqf1992]]></copyright><item><title><![CDATA[回溯法Square]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/50060201</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/50060201</guid><author>hqf1992</author><pubDate>Thu, 26 Nov 2015 19:46:22 +0800</pubDate><description><![CDATA[Square
Description
Given a set ofsticks of various lengths, is it possible to join them end-to-end to form asquare?
Input
The first line ofinput contains N, the number of test cases. Each test cas]]></description><category></category></item><item><title><![CDATA[回溯法Matrix]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/50060103</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/50060103</guid><author>hqf1992</author><pubDate>Thu, 26 Nov 2015 19:39:10 +0800</pubDate><description><![CDATA[Matrix
Description
Given an n*nmatrix A, whose entries Ai,j are integer numbers ( 0 <= i < n, 0 <= j< n ). An operation SHIFT at row i ( 0 <= i < n ) will move theintegers in the row one position ri]]></description><category></category></item><item><title><![CDATA[回溯法Perfect Cubes]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/48844817</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/48844817</guid><author>hqf1992</author><pubDate>Thu, 01 Oct 2015 09:34:13 +0800</pubDate><description><![CDATA[Perfect Cubes
Description
For hundreds ofyears Fermat's Last Theorem, which stated simply that for n > 2 there existno integers a, b, c > 1 such that a^n = b^n + c^n, has remained elusivelyunproven.]]></description><category></category></item><item><title><![CDATA[回溯法之Additive equations]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/48810353</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/48810353</guid><author>hqf1992</author><pubDate>Tue, 29 Sep 2015 19:43:45 +0800</pubDate><description><![CDATA[Additive equations



Time Limit: 10 Seconds      Memory Limit: 32768 KB



    We all understandthat an integer set is a collection of distinct integers. Now the question is:given an integer ]]></description><category></category></item><item><title><![CDATA[回溯 dp FatMouse and Cheese]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/48792433</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/48792433</guid><author>hqf1992</author><pubDate>Mon, 28 Sep 2015 23:15:25 +0800</pubDate><description><![CDATA[FatMouse and Cheese
 
FatMouse has stored some cheese in a city.The city can be considered as a square grid of dimension n: each grid locationis labelled (p,q) where 0 <= p < n and 0 <= q < n. At ea]]></description><category></category></item><item><title><![CDATA[回溯算法之Anagrams by Stack]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47759787</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47759787</guid><author>hqf1992</author><pubDate>Tue, 18 Aug 2015 21:05:19 +0800</pubDate><description><![CDATA[Anagrams by Stack
 
How can anagrams result from sequences ofstack operations? There are two sequences of stack operators which can convertTROT to TORT:
[
i i i i o o o o
i o i i o o i o
]
wher]]></description><category></category></item><item><title><![CDATA[回溯法之Fire Net]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47703123</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47703123</guid><author>hqf1992</author><pubDate>Sun, 16 Aug 2015 16:09:21 +0800</pubDate><description><![CDATA[Fire Net
Suppose that we have a square city withstraight streets. A map of a city is a square board with n rows and n columns,each representing a street or a piece of wall.
A blockhouse is a small c]]></description><category></category></item><item><title><![CDATA[贪心算法之Elevator Stopping Plan]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47700445</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47700445</guid><author>hqf1992</author><pubDate>Sun, 16 Aug 2015 10:30:58 +0800</pubDate><description><![CDATA[Elevator Stopping Plan
Description
ZSoft Corp. is asoftware company in GaoKe Hall. And the workers in the hall are veryhard-working. But the elevator in that hall always drives them crazy. Why?Becau]]></description><category></category></item><item><title><![CDATA[贪心算法之Evil Straw Warts Live]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47684863</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47684863</guid><author>hqf1992</author><pubDate>Sat, 15 Aug 2015 19:40:59 +0800</pubDate><description><![CDATA[Evil Straw Warts Live

Description
A palindrome is astring of symbols that is equal to itself when reversed. Given an input string,not necessarily a palindrome, compute the number of swaps necessar]]></description><category></category></item><item><title><![CDATA[贪心算法之ian Ji -- The Horse Racing]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47683231</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47683231</guid><author>hqf1992</author><pubDate>Sat, 15 Aug 2015 16:44:27 +0800</pubDate><description><![CDATA[Tian Ji -- The Horse Racing
Description
Here is a famousstory in Chinese history. 
That was about2300 years ago. General Tian Ji was a high official in the country Qi. He likesto play horse racing ]]></description><category></category></item><item><title><![CDATA[贪心算法New Year BonusGrant]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47669933</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47669933</guid><author>hqf1992</author><pubDate>Fri, 14 Aug 2015 23:09:40 +0800</pubDate><description><![CDATA[New Year BonusGrant
 
All programmers of Mocrosoft softwarecompany are organized in a strict subordination hierarchy. Every programmer hasexactly one chief, except Bill Hates who is also the head of]]></description><category></category></item><item><title><![CDATA[贪心算法之Stripies]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47394159</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47394159</guid><author>hqf1992</author><pubDate>Mon, 10 Aug 2015 09:51:17 +0800</pubDate><description><![CDATA[Stripies
 
Our chemical biologists have invented anew very useful form of life called stripies (in fact, they were first calledin Russian - polosatiki, but the scientists had to invent an English na]]></description><category></category></item><item><title><![CDATA[贪心算法之Radar Installation]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47381973</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47381973</guid><author>hqf1992</author><pubDate>Sun, 09 Aug 2015 23:20:17 +0800</pubDate><description><![CDATA[Radar Installation
Description
Assume thecoasting is an infinite straight line. Land is in one side of coasting, sea inthe other. Each small island is a point locating in the sea side. And any radar]]></description><category></category></item><item><title><![CDATA[贪心算法之Packets]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47375923</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47375923</guid><author>hqf1992</author><pubDate>Sun, 09 Aug 2015 14:40:57 +0800</pubDate><description><![CDATA[Packets
Description
A factory producesproducts packed in square packets of the same height h and of the sizes 1*1,2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers inthe squa]]></description><category></category></item><item><title><![CDATA[贪心算法之Entropy]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47362635</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47362635</guid><author>hqf1992</author><pubDate>Sat, 08 Aug 2015 21:48:52 +0800</pubDate><description><![CDATA[Entropy
Description
An entropy encoderis a data encoding method that achieves lossless data compression by encoding amessage with "wasted" or "extra" information removed. Inother words, entropy enco]]></description><category></category></item><item><title><![CDATA[动态规划之Cash Machine]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47262807</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47262807</guid><author>hqf1992</author><pubDate>Mon, 03 Aug 2015 21:17:10 +0800</pubDate><description><![CDATA[Cash Machine
Description
A Bank plans toinstall a machine for cash withdrawal. The machine is able to deliverappropriate @ bills for a requested cash amount. The machine uses exactly Ndistinct bill ]]></description><category></category></item><item><title><![CDATA[动态规划之UNIMODAL PALINDROMIC DECOMPOSITIONS]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47261205</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47261205</guid><author>hqf1992</author><pubDate>Mon, 03 Aug 2015 19:59:08 +0800</pubDate><description><![CDATA[UNIMODAL PALINDROMIC DECOMPOSITIONS
Description
A sequence ofpositive integers is Palindromic if it reads the same forward and backward. Forexample: 
23 11 15 1 37 37 1 15 11 23 
1 1 2 3 4 7 7 10 ]]></description><category></category></item><item><title><![CDATA[动态规划之Jury Compromise]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47168675</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47168675</guid><author>hqf1992</author><pubDate>Fri, 31 Jul 2015 13:16:54 +0800</pubDate><description><![CDATA[Jury Compromise
 
In Frobnia, a far-awaycountry, the verdicts in court trials are determined by a jury consisting ofmembers of the general public. Every time a trial is set to begin, a jury hasto be]]></description><category></category></item><item><title><![CDATA[Optimal ArrayMultiplication Sequence]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47144493</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47144493</guid><author>hqf1992</author><pubDate>Thu, 30 Jul 2015 09:36:10 +0800</pubDate><description><![CDATA[Optimal ArrayMultiplication Sequence
Given two arrays A and B, we can determinethe array C = A B using the standard definition of matrix multiplication:

The number of columns in the A array mustbe]]></description><category></category></item><item><title><![CDATA[典型动态规划之Always On the Run]]></title><link>https://blog.youkuaiyun.com/hqf1992/article/details/47124193</link><guid>https://blog.youkuaiyun.com/hqf1992/article/details/47124193</guid><author>hqf1992</author><pubDate>Wed, 29 Jul 2015 11:05:00 +0800</pubDate><description><![CDATA[Always On the Run
Description
Screeching tires. Searching lights. Wailing sirens.Police cars everywhere. Trisha Quickfinger did it again! Stealing the `MonaLisa' had been more difficult than planned]]></description><category></category></item></channel></rss>