算法竞赛入门经典训练指南-第一章
lab104_yifan
这个作者很懒,什么都没留下…
展开
-
UVA 11300 - Spreading the Wealth(数学推导+中位数)
F. Spreading the Wealth ProblemA Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has c原创 2013-12-07 11:38:19 · 1585 阅读 · 0 评论 -
UVA 1388 - Graveyard (推理,参考系)
Programming contests became so popular in the year 2397 that the governor of New Earck -- the largest human-inhabited planet of the galaxy -- opened a special Alley of Contestant Memories (ACM) at the原创 2013-12-07 13:00:38 · 1290 阅读 · 0 评论 -
UVA 10795 - A Different Task(递归)
A Different Task The (Three peg) Tower of Hanoi problem is a popular one in computer science. Briefly the problem is to transfer all the disks from peg-A to peg-C using peg-B as in原创 2013-12-08 22:43:44 · 1353 阅读 · 0 评论 -
UVA 10881 - Piotr's Ants(等效变换)
Problem DPiotr's AntsTime Limit: 2 seconds"One thing is for certain: there is no stopping them;the ants will soon be here. And I, for one, welcome ournew insect overlords."原创 2013-12-08 23:41:44 · 1133 阅读 · 0 评论 -
UVA 11464 - Even Parity(枚举方法)
DEven ParityInput: Standard InputOutput: Standard OutputWe have a grid of size N x N. Each cell of the grid initially contains a zero(0) or a one(1). The parity of a ce原创 2013-12-10 22:01:02 · 1231 阅读 · 0 评论 -
1030 - Image Is Everything (贪心)
Your new company is building a robot that can hold small lightweight objects. The robot will have the intelligence to determine if an object is light enough to hold. It does this by taking pictures of原创 2013-12-10 20:21:29 · 1017 阅读 · 0 评论 -
1346 - Songs (贪心)
John Doe is a famous DJ and, therefore, has the problem of optimizing the placement of songs on his tapes. For a given tape and for each song on that tape John knows the length of the song and the fre原创 2013-12-10 20:50:47 · 1623 阅读 · 0 评论 -
11636 - Hello World! (贪心法)
Problem AHello World! Input: Standard InputOutput: Standard Output When you first made the computer to print the sentence “Hello World!”, you felt so happy, not knowing how complex and inter原创 2013-12-10 21:13:46 · 1442 阅读 · 0 评论 -
UVA 12124 UVAlive 3971 Assemble(二分 + 贪心)
Problem A - AssembleTime limit: 2 secondsRecently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new原创 2013-08-22 21:30:57 · 1482 阅读 · 0 评论 -
1352 - Colored Cubes (枚举方法)
There are several colored cubes. All of them are of the same size but they may be colored differently. Each face of these cubes has a single color. Colors of distinct faces of a cube may or may not be原创 2013-12-12 12:40:09 · 1455 阅读 · 0 评论 -
UVA 11039 - Building designing
Building designing An architect wants to design a very high building. The building will consist of some floors, and each floor has a certain size. The size of a floor must be greater tha原创 2013-12-12 12:59:41 · 1280 阅读 · 0 评论 -
UVA 10317 - Equating Equations (背包)
Problem FEquating EquationsInput: standard inputOutput: standard outputTime Limit: 6 secondsMemory Limit: 32 MB Read equations with up to 16 terms and + and – operators (not unary) and r原创 2013-12-13 10:08:25 · 1562 阅读 · 0 评论 -
UVA 11292 The Dragon of Loowater 英文略长略长
UVA 11292 The Dragon of Loowater其实很水的。。。看题目花的时间比写的时间更久。题意是 一个龙有n个头 头都有直径 有m个骑士 骑士有身高 如果身高超过直径 骑士就能砍下龙头 一个骑士只能砍一个头 国王雇佣骑士 价格是骑士的身高 求国王最少要多少钱才能杀掉龙 如果杀不掉 就输出 Loowater is doomed!贪心思想,直接骑士和龙头都从原创 2013-07-18 01:50:01 · 1342 阅读 · 0 评论 -
UVA 11384 - Help is needed for Dexter(递归)
Problem HHelp is needed for DexterTime Limit: 3 Second Dexter is tired of Dee Dee. So he decided to keep Dee Dee busy in a game. The game he planned for her is quite easy to play but not easy原创 2013-12-06 20:34:42 · 1746 阅读 · 0 评论 -
UVA 11729 - Commando War(贪心)
GCommando WarInput: Standard InputOutput: Standard Output “Waiting for orders we held in the wood, word from the front never cameBy evening the sound of the gunfire was原创 2013-12-06 21:00:59 · 1208 阅读 · 0 评论 -
UVA 1339 - Ancient Cipherguo
Ancient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form原创 2013-12-13 12:53:13 · 1173 阅读 · 0 评论 -
UVA 669 - Defragment(dfs)
Defragment You are taking part in the development of a ``New Generation'' operating system and the NG file system. In this file system all disk space is divided into N clusters of the eq原创 2013-12-28 22:49:17 · 1503 阅读 · 0 评论 -
UVA 1523 - Helicopter(暴力枚举)
Since ancient time, people have been dreaming of flying in the sky. Eventually, the dream was realized in the 20th century. Nowadays, the airplane becomes a useful vehicle that is used frequently in o原创 2013-12-28 11:23:38 · 2007 阅读 · 0 评论 -
UVA 11134 - Fabled Rooks(贪心+优先队列)
We would like to place n rooks, 1 ≤ n ≤ 5000, on a n×n board subject to the following restrictionsThe i-th rook can only be placed within the rectangle given by its left-upper corner (xli, yli)原创 2013-12-19 21:19:00 · 1261 阅读 · 0 评论 -
1267 - Network (贪心)
Consider a tree network with n nodes where the internal nodes correspond to servers and the terminal nodes correspond to clients. The nodes are numbered from 1 to n . Among the servers, there is an原创 2013-12-16 20:35:00 · 1354 阅读 · 0 评论 -
UVA 11210 - Chinese Mahjong(暴力枚举)
Problem CChinese MahjongMahjong () is a game of Chinese origin usually played by four persons with tiles resembling dominoes and bearing various designs, which are drawn and discarded until原创 2013-12-16 16:15:21 · 1717 阅读 · 0 评论 -
UVA 1368 - DNA Consensus String(贪心)
Figure 1.DNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nucleotides, namely Adenine, Thymine, Guanine, and Cytosine as shown in Fi原创 2013-12-16 16:10:11 · 2109 阅读 · 2 评论 -
UVA 1335 - Beijing Guards(贪心)
Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in t原创 2013-12-17 20:44:35 · 1308 阅读 · 0 评论 -
UVA 11520 - Fill the Square (贪心)
Problem AFill the SquareInput: Standard InputOutput: Standard Output In this problem, you have to draw a square using uppercase English Alphabets.To be more precise, you will be given a sq原创 2013-12-12 18:52:03 · 1046 阅读 · 0 评论 -
UVA 1422 - Processor (二分+贪心+优先队列)
An ``early adopter" Mr. Kim bought one of the latest notebooks which has a speed-controlled processor. The processor is able to operate at variable speed. But the higher the speed, the higher the po原创 2013-12-17 11:45:21 · 1152 阅读 · 0 评论 -
UVA 1419 - Ugly Windows(搜索,模拟)
Sheryl works for a software company in the country of Brada. Her job is to develop a Windows operating system. People in Brada are incredibly conservative. They even never use graphical monitors! So S原创 2013-12-31 22:09:45 · 1131 阅读 · 0 评论 -
1420 - Priest John's Busiest Day (贪心)
John is the only priest in his town. October 26th is the John's busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forever blessed by原创 2014-01-01 00:41:12 · 1803 阅读 · 0 评论 -
UVA 798 - Tile Puzzle(暴力枚举)
Tile Puzzle In a puzzle a rectangular surface of width w and height h is split into a collection of rectangular tiles. The tiles with the same dimensions form a similarity group. Solving原创 2014-01-01 12:11:55 · 1905 阅读 · 0 评论 -
UVA 10037 - Bridge(贪心)
Problem D: Bridgen people wish to cross a bridge at night. A group of at most two people may cross at any time, and each group must have a flashlight. Only one flashlight is available among the原创 2014-01-01 14:58:55 · 2502 阅读 · 0 评论 -
1153 - Keep the Customer Satisfied(贪心+优先队列)
Simon and Garfunkel Corporation (SG Corp.) is a large steel-making company with thousand of customers. Keeping the customer satisfied is one of the major objective of Paul and Art, the managers.Cust原创 2013-12-31 21:07:02 · 1343 阅读 · 0 评论 -
11627 - Slalom (二分+贪心)
Problem E: SlalomYou are competing in a ski slalom, and you need to select the best skis for the race. The format of the race is that there are N pairs of left and right gates, where each right ga原创 2013-12-18 16:56:32 · 1066 阅读 · 0 评论 -
UVA 1533 - Moving Pegs (广搜+hash判重)
Venture MFG Company, Inc. has made a game board. This game board has 15 holes and these holes are filled with pegs except one hole. A peg can jump over one or more consecutive peg s to the nearest emp原创 2013-12-28 19:49:47 · 1966 阅读 · 0 评论 -
UVA 769 - Magic of David Copperfield(构造问题)
Magic of David Copperfield The well-known magician David Copperfield loves to show the following trick: a square with N rows and Ncolumns of different pictures appears on a TV screen. Le原创 2014-01-02 10:45:41 · 1720 阅读 · 0 评论 -
UVA 1344 - Tian Ji -- The Horse Racing(贪心)
Here is a famous story in Chinese history.That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others.Both of T原创 2013-12-20 08:43:29 · 1134 阅读 · 0 评论 -
UVA 818 - Cutting Chains(暴力+dfs判环+位运算)
Cutting Chains What a find! Anna Locke has just bought several links of chain some of which may be connected. They are made from zorkium, a material that was frequently used to manufactu原创 2014-01-04 11:23:34 · 5540 阅读 · 2 评论 -
UVA 687 - Lattice Practices(暴力枚举+位运算)
Lattice Practices Once upon a time, there was a king who loved beautiful costumes very much. The king had a special cocoon bed to make excellent cloth of silk. The cocoon bed had 16 smal原创 2013-12-30 23:08:55 · 1466 阅读 · 1 评论 -
UVA 11389 - The Bus Driver Problem (贪心)
I I U C O N L I N E C O N T E S T 2 0 0 8Problem E: The Bus Driver ProblemInput: standard inputOutput: standard output In a city there are n bus drive原创 2013-12-20 09:06:32 · 1882 阅读 · 1 评论 -
UVA 11100 - The Trip, 2007(贪心)
Problem A: The Trip, 2007A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadel原创 2013-12-20 09:25:45 · 1469 阅读 · 0 评论 -
UVA 225 - Golygons(dfs回溯)
Golygons Imagine a country whose cities have all their streets laid out in a regular grid. Now suppose that a tourist with an obsession for geometry is planning expeditions to several su原创 2014-01-03 23:39:24 · 3668 阅读 · 3 评论 -
11127 - Triple-Free Binary Strings(dfs+位运算)
Problem JTriple-Free Binary Strings Input: Standard InputOutput: Standard Output A binary string consists of ones and zeros. Given a binary string T, if there is no binary string S such tha原创 2014-01-05 12:59:21 · 1262 阅读 · 0 评论