算法竞赛入门经典训练指南-第一章
文章平均质量分 88
zhaosdfa
这个作者很懒,什么都没留下…
展开
-
UVa 11584 - Partitioning by Palindromes(简单DP)
Partitioning by PalindromesTime Limit:1000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionProblem H: Partitioning原创 2014-07-27 14:45:30 · 448 阅读 · 0 评论 -
UVa 11552 - Fewest Flops(简单DP)
Fewest FlopsTime Limit:2000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionProblem F FEWEST FLOPSA common way原创 2014-07-28 08:42:39 · 393 阅读 · 0 评论 -
UVa 10534 - Wavio Sequence (简单DP 最长上升下降子序列)
Wavio SequenceTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem DWavio Sequence原创 2014-07-27 18:20:20 · 514 阅读 · 0 评论 -
UVA 11134 - Fabled Rooks
Fabled Rooks We would like to placen rooks,1 ≤ n ≤ 5000, on a n×nboard subject to the following restrictionsThei-th rook can only be placed within the rectangle given byits left-upper corner (原创 2014-01-04 21:35:24 · 649 阅读 · 0 评论 -
UVA 10382 - Watering Grass
Watering GrassInput: standard inputOutput: standard outputTime Limit: 3 secondsn sprinklers areinstalled in a horizontal strip of grass l meters long andwmeters wide. Each sprinkler is i原创 2013-11-11 22:43:48 · 1193 阅读 · 0 评论 -
UVA 10970 - Big Chocolate Amirkabir University of Technology - Local Contest - Round #2 G
Problem GBig ChocolateMohammad has recently visited Switzerland. As he loves his friends very much, he decided to buy some chocolate for them, but as this fine chocolate is very expensive(You know原创 2013-08-20 20:39:51 · 787 阅读 · 0 评论 -
UVA 10827 - Maximum sum on a torus
Maximum sum on a torusInput: Standard InputOutput: Standard Output A grid that wraps both horizontally and vertically is called a torus. Given a torus where each cell contains an integer, de原创 2014-07-02 18:46:13 · 405 阅读 · 0 评论 -
UVA 1450 LA 4725 Airport
AirportA big city has an international airport handling 40 million passengers a year. But this is notorious as one of the most congested airports in the world. In this airport, there is only one原创 2014-01-07 15:21:38 · 1158 阅读 · 1 评论 -
UVA 1344 / UVALive 3266 / POJ 2287 / HDU 1052 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 Ti原创 2014-06-27 08:39:08 · 618 阅读 · 0 评论 -
UVaLive LA 4256 | UVa 1424 - Salesmen(简单DP)
SalesmenTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionTraveling salesmen of nhn. (the prestigiou原创 2014-07-27 15:31:03 · 1042 阅读 · 0 评论 -
UVa 11404 - Palindromic Subsequence (最长回文子序列 DP)
Palindromic SubsequenceTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] Description A Subsequence is a sequenc原创 2014-07-28 21:16:18 · 575 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 51656 Accepted: 15382Case Time Limit: 2000MSDescriptionYou have N i原创 2013-12-30 19:04:45 · 468 阅读 · 0 评论 -
HDU 2476 | UVALive 4394 - String painter (区间DP)
String painterTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1625 Accepted Submission(s): 728Problem DescriptionThere ar原创 2014-08-13 21:59:56 · 632 阅读 · 0 评论 -
UVaLive 4327 | POJ 3926 - Parade (单调队列优化DP)
ParadeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 658 Accepted: 151DescriptionPanagola, The Lord of city F likes to parade very much. He always insp原创 2014-08-13 14:50:46 · 952 阅读 · 0 评论 -
UVALive 2038 - Strategic game (经典树形DP)
Strategic gameTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionBob enjoys playing computer原创 2014-08-11 15:56:06 · 552 阅读 · 0 评论 -
UVa 10817 - Headmaster's Headache (简单DP 状态压缩)
Headmaster's HeadacheTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem D:原创 2014-08-11 14:15:24 · 508 阅读 · 0 评论 -
UVa 10564 - Paths through the Hourglass (简单DP)
Paths through the HourglassTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem FPaths through原创 2014-08-11 10:57:20 · 475 阅读 · 0 评论 -
UVa 11795 - Mega Man's Mission (集合DP 状态压缩)
Mega Man's MissionTime Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] Description B Meg原创 2014-08-01 08:22:05 · 596 阅读 · 0 评论 -
UVaLive 4731 UVa 1456 - Cellular Network(概率DP 贪心)
Cellular NetworkTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionA cellular network is a radio netw原创 2014-07-30 23:16:16 · 770 阅读 · 0 评论 -
UVaLive 3530 - Martian Mining (简单DP)
Martian MiningTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionThe NASA Space Center, Houston, is l原创 2014-08-05 10:23:40 · 657 阅读 · 0 评论 -
UVa 10125 - Sumsets (中途相遇法 hash)
SumsetsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] Description Problem D - Find DUsers are原创 2014-07-02 20:42:31 · 638 阅读 · 0 评论 -
UVA 11389 - The Bus Driver Problem
IIU C ONLINE C ON TEST 2 008Problem E: The Bus Driver ProblemInput: standard inputOutput: standard output In a city there are n bus drivers. Also t原创 2014-06-27 09:06:15 · 497 阅读 · 0 评论 -
LA 3902 UVA 1267 - Network
1267 - NetworkTime limit: 3.000 secondsConsider 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原创 2013-08-16 14:21:48 · 522 阅读 · 0 评论 -
UVA 10905 - Children's Game
------------------------------------------------------------------------4thIIUCInter-University Programming Contest, 2005AChildren’s GameInput原创 2013-11-12 21:59:27 · 692 阅读 · 0 评论 -
POJ 1901 | LA 2963 | UVa 1325 - Hypertransmission (思维 扫描)
HypertransmissionTime Limit: 10000MS Memory Limit: 30000KTotal Submissions: 1477 Accepted: 361 Special JudgeDescriptionThe president of the Galactic Federat原创 2014-07-04 12:09:46 · 753 阅读 · 0 评论 -
UVaLive LA 5052 UVa 1481 - Genome Evolution (很巧妙的思维)
Xi, a developmental biologist is working on developmental distances of chromosomes. A chromosome, in the Xi's simplistic view, is a permutation fromn genes numbered 1 to n. Xi is working on an evolu原创 2014-07-22 21:50:43 · 625 阅读 · 0 评论 -
UVaLive LA 4356 - Fire-Control System (扫描法 思维)
Fire-Control SystemTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionA new mighty weapon has just be原创 2014-07-22 10:30:13 · 1193 阅读 · 0 评论 -
UVa 10391 - Compound Words (字符串hash)
Compound WordsTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionProblem E: Compound WordsYou are to原创 2014-07-20 08:58:26 · 384 阅读 · 0 评论 -
UVaLive LA 4726 UVa 1451 - Average (子序列最大平均数 数形结合 斜率优化 单调队列)
AverageTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] DescriptionA DNA sequence consists of four letters, A, C原创 2014-07-21 09:26:05 · 872 阅读 · 0 评论 -
UVa 11054 - Wine trading in Gergovia(扫描法 水题)
Wine trading in GergoviaTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] Description2006/2007 ACM Internationa原创 2014-07-20 09:52:25 · 452 阅读 · 0 评论 -
UVaLive 4851 UVa 1468 - Restaurant (思维)
RestaurantTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit] [Go Back] [Status] Description Mr. Kim is planning to open a new resta原创 2014-07-21 14:14:51 · 656 阅读 · 0 评论 -
LA 3177 UVA 1335 - Beijing Guards
Time limit: 3.000 secondsBeijing 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原创 2013-08-16 14:21:50 · 499 阅读 · 0 评论 -
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原创 2014-01-07 10:12:29 · 1125 阅读 · 0 评论 -
UAV 11078 - Open Credit System
Problem EOpen Credit SystemInput: Standard InputOutput: Standard OutputIn an open credit system, the students can chooseany course they like, but there is a problem. Some of the students are m原创 2014-01-07 17:43:25 · 1063 阅读 · 0 评论 -
UVA 10340 - All in All
Problem EAll in AllInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MBYou have devised a new encryption technique which encodes a message by inserting betw原创 2013-08-20 21:26:01 · 463 阅读 · 0 评论 -
UVA 1339 - Ancient Cipher
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 t原创 2013-08-16 14:21:55 · 448 阅读 · 0 评论 -
UVA 11520 Fill the Square
第一篇题解题意:一个n*n的网格里面填了些大写字母,把剩下的也填上,使得相邻的两个网格不相同,并且从左到右,从上到下连起来的字典序最小。直接对每一个没填的网格依次考虑A到Z是否可以。 1 #include 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 const原创 2013-08-16 14:21:41 · 678 阅读 · 0 评论 -
UVA 1330 LA 3029 seerc 2004 - City Game
Bob is a strategy game programming specialist. In his new city building game thegaming environment is as follows: a city is built up by areas, in which there are streets, trees,factories and buildings原创 2014-03-08 18:43:51 · 648 阅读 · 0 评论 -
UVA 11462 - Age Sort
BAge SortInput: Standard InputOutput: Standard Output You are given the ages (in years) of allpeople of a country with at least 1 year of age. You know that no individual i原创 2014-01-07 17:24:31 · 645 阅读 · 0 评论 -
LA 3602 UVA 1368 - DNA Consensus String
zhaosdfaLA 3602 UVA 1368 - DNA Consensus String Figure 1. DNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nucleotides, name原创 2013-08-20 20:20:26 · 699 阅读 · 0 评论