UVa OJ
文章平均质量分 61
Yuukidach
一个永远不会发芽的MADAO
展开
-
UVa OJ 1606 - Amphiphilic Carbon Molecules
UVa OJ 1606 - Amphiphilic Carbon MoleculesProblem平面上有n(n≤1000)个点,每个点为白点或者黑点。现在需放置一条隔板,使得隔板一侧的白点数加上另一侧的黑点数总数最大。隔板上的点可以看作是在任意一侧。Input不超过10个测试情况。每种情况以一个整数N开始,代表点的个数,接着输入N行x,y,r,分别表示坐标点的x坐标,y坐标和点的颜色,其中1是黑色原创 2016-08-16 18:11:11 · 388 阅读 · 0 评论 -
UVa OJ 1607 - Gates
UVa OJ 1607 - GatesProblem描述起来很麻烦,大家还是直接去OJ站看吧。我之后也会解释一下题目的意思 题目链接: 1607 - GatesInputThe first line of the input contains exactly one positive integer d equal to the number of data sets, 1 ≤ d ≤ 20. T原创 2016-09-06 11:04:40 · 534 阅读 · 0 评论 -
UVa OJ 12174 - Shuffle
ProblemYou are listening to your music collection using the shuffle function to keep the music surprising. You assume that the shuffle algorithm of your music player makes a random permutation of the s原创 2016-09-06 22:59:32 · 346 阅读 · 0 评论 -
UVa OJ 437 - The Tower of Babylon
UVa OJ 437 - The Tower of BabylonProblemThe babylonians had n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions (xi, yi,原创 2016-09-22 23:07:00 · 324 阅读 · 0 评论 -
UVa OJ 1347 - Tour
UVa OJ 1347 - TourProblemJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must determine the shortest clo原创 2016-09-23 15:55:11 · 519 阅读 · 0 评论 -
UVa OJ 1442 - Cav
UVa OJ 1442 - CavProblemLink: 1442 - CavSolutionUse greedy algorithm to deal with this problem.Adjust the height of ceiling to fit the requirements. Here is the code:#include <iostream>#include <cstdi原创 2016-09-20 20:57:23 · 366 阅读 · 0 评论 -
UVa OJ 116 - Unidirectional TSP
UVa OJ 116 - Unidirectional TSPProblemHere is the: problem linkSolutions这道题目不难,但是要注意一下输出的格式,我因为输出格式的问题反复提交了好几次我们用dp[i][j]来表示(i,j)距离最后一列的距离。为了节省时间,用了一个Next[]数组来保存向右走的路径,避免反复取余造成的时间上的浪费。还有,记得不要用next和end,原创 2016-09-24 09:41:39 · 383 阅读 · 0 评论 -
UVa OJ 11400 - Lighting System Design
UVa OJ 11400 - Lighting System DesignProblemYou are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation and sketching, you have figured out the requi原创 2016-09-25 11:18:19 · 328 阅读 · 0 评论 -
UVa OJ 12563 - Jin Ge Jin Qu hao
UVa 12563 - Jin Ge Jin Qu haoProblemHere is the: linkSolution这道题目一开始用时间作为一个大循环去进行递推,但是发现并不是很好判断歌曲是否有唱过,所以后来还是采用歌曲作为大循环,再以时间为小循环。不过记得要留出出1s来给《劲歌金曲》#include <iostream>#include <cstdio>#include <cstring原创 2016-09-24 22:11:07 · 305 阅读 · 0 评论 -
UVa OJ 12265 - Selling Land
UVa OJ 12263 - Selling LandProblem输入一个n*m(1≤n,m≤1000)矩阵,每个格子可能是空地,也可能是沼泽。对于每个空地格子,求出以它为右下角的空矩形的最大周长,然后统计每个周长出现了多少次。InputOn the first line a positive integer: the number of test cases, at most 100. Afte原创 2016-09-21 21:00:50 · 358 阅读 · 0 评论 -
UVa OJ 11584 - Partitioning by Palindromes
UVa OJ 11584 - Partitioning by PalindromesProblemHere is the: linkSolution先对字符串进行预处理,把回文字符串的长度全部记录下来,然后用DP对回文字符串的个数进行处理。最小个数=min(之前已经处理过的长度所含回文字符串的最小值+未处理的长度所含回文字符数的最小值)#include <iostream>#include <cs原创 2016-09-25 13:51:57 · 316 阅读 · 0 评论 -
UVa OJ 1625 - Color Length
UVa OJ 1625 - Color LengthProblemHere is the prolem linkSolution这道题目要先处理好每个颜色的起止位置,不然会很不方便。用数组d[i][j]表示已经插入了第一个字符串的i个,第二个字符串的j个字母。递推的时候,只要发现还有字母没有用完,就加1#include <iostream>#include <cstdio>#include <c原创 2016-09-27 09:16:08 · 374 阅读 · 0 评论 -
UVa OJ 10003 - Cutting Sticks
UVa OJ 10003 - Cutting SticksProblemYou have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), charges money according to the length of the stick b原创 2016-09-27 12:58:53 · 434 阅读 · 0 评论 -
UVa OJ 1331 - Minimax Triangulation
UVa OJ 1331 - Minimax TriangulationProblemHere is the: problem linkSolution这道题目一开始用递归做,但是时间比较长,于是花了比较长的时间去想应该怎么才能转化成递推这道题目用d[i][j]来表示从i点切割到j点中所含的面积最大的三角形中,最小的那个这里用了三个循环,第一层是确定分割时跨越的点数,第二层是起点,第三层就是起点和终点原创 2016-09-29 16:45:29 · 433 阅读 · 0 评论 -
UVa OJ 12186 - Another Crisis
UVa OJ 12186 - Another CrisisProblemA couple of years ago, a new world wide crisis started, leaving many people with economical problems. Some workers of a particular company are trying to ask for an原创 2016-09-29 21:57:29 · 316 阅读 · 0 评论 -
UVa OJ 1471 - Defense Lines
UVa OJ 1471 - Defense LinesProblemAfter the last war devastated your country, you - as the king of the land of Ardenia - decided it was high time to improve the defense of your capital city. A part of原创 2016-08-26 15:09:29 · 477 阅读 · 0 评论 -
UVa OJ 11093 - Just Finish it up
UVa OJ 11093 - Just Finish it upProblemAlong a circular track, there are N gas stations, which are numbered clockwise from 1 up to N. At station i, there are pi gallons of petrol available. To race fro原创 2016-09-05 19:55:15 · 395 阅读 · 0 评论 -
UVa OJ 11572 - Unique Snowflakes
UVa OJ 11572 - Unique SnowflakesProblem输入一个长度为n(n≤106)的序列A,找到一个尽量长的连续子序列AL~AR,使得该序 列中没有相同的元素。InputThe first line of input contains one integer specifying the number of test cases to follow. Each test c原创 2016-08-25 23:50:52 · 580 阅读 · 1 评论 -
UVa OJ 10603 - Fill
UVa OJ 10603-FillProblemThere are three jugs with a volume of a, b and c liters. (a, b, and c are positive integers not greater than 200). The first and the second jug are initially empty, while the th原创 2016-08-01 16:38:41 · 328 阅读 · 0 评论 -
UVa OJ 1601 - The Morning after Halloween
UVa OJ 1601-The Morning after HalloweenProblemYou are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in which guests walk through narrow and dark corridors. The ho原创 2016-08-04 11:38:36 · 493 阅读 · 0 评论 -
UVa OJ 11212 - Editing a Book
UVa OJ 11212 - Editing a Book(IDA*)Problem 你有一篇由n(2≤n≤9)个自然段组成的文章,希望将它们排列成1, 2,…, n。可以用 Ctrl+X(剪切)和Ctrl+V(粘贴)快捷键来完成任务。每次可以剪切一段连续的自然段,粘贴时按照顺序粘贴。注意,剪贴板只有一个,所以不能连续剪切两次,只能剪切和粘贴交替。 例如,为了将{2,4,1,5,3,6}变为原创 2016-08-05 22:59:09 · 351 阅读 · 0 评论 -
UVa OJ 120 - Stacks of Flapjacks
UVa OJ 120 - Stacks of FlapjacksProblem 有一叠煎饼正在锅里。煎饼共有n(n≤30)张,每张都有一个数字,代表它的大小,如 图8-11所示。厨师每次可以选择一个数k,把从锅底开始数第k张上面的煎饼全部翻过来,即 原来在上面的煎饼现在到了下面。 设计一种方法使得所有煎饼按照从小到大排序(最上面的煎饼最小)。输入时,各个煎 饼按照从上到下的顺序给出。 In原创 2016-08-06 19:10:29 · 403 阅读 · 0 评论 -
UVa OJ 1451 - Average
UVa OJ 1451 - AverageProblem给定一个长度为n的01串,选一个长度至少为L的连续子串,使得子串中数字的平均值最 大。如果有多解,子串长度应尽量小;如果仍有多解,起点编号尽量小。序列中的字符编号 为1~n,因此[1,n]就是完整的字符串。1≤n≤100000,1≤L≤1000。 例如,对于如下长度为17的序列00101011011011010,如果L=7,最大平均值为6/8原创 2016-08-29 10:25:11 · 557 阅读 · 0 评论 -
UVa OJ 1605 - Building for UN
UVa OJ 1605 - Building for UNProblem 你的任务是设计一个包含若干层的联合国大楼,其中每层都是一个等大的网格。有若干 国家需要在联合国大楼里办公,你需要把每个格子分配给一个国家,使得任意两个不同的国 家都有一对相邻的格子(要么是同层中有公共边的格子,要么是相邻层的同一个格子)。你设计的大厦最多不能超过1000000个格子。 Input 输入国家的个数n(n≤5原创 2016-08-07 19:07:04 · 394 阅读 · 6 评论 -
UVa OJ 1608 - Non-boring sequences
UVa OJ 1608 - Non-boring sequencesProblemA sequence is called non-boring if its every connected subsequence contains a unique element, i.e. an element such that no other element of that subsequence has原创 2016-09-10 17:52:59 · 462 阅读 · 0 评论 -
UVa OJ 1152 - 4 Values whose Sum is 0
UVa OJ 1152 - 4 Values whose Sum is 0Problem给定4个n(1≤n≤4000)元素集合A, B, C, D,要求分别从中选取一个元素a, b, c, d,使得 a+b+c+d=0。问:有多少种选法? InputThe input begins with a single positive integer on a line by itself indicat原创 2016-08-08 20:59:06 · 420 阅读 · 0 评论 -
UVa OJ 11134 - Fabled Rooks
UVa OJ 11134 - Fabled RooksProblem 在n*n的棋盘上放n(n≤5000)个车,使得任意两个车不相互攻击,且第i个 车在一个给定的矩形Ri之内。用4个整数xli, yli, xri, yri(1≤xli≤xri≤n,1≤yli≤yri≤n)描述第i个 矩形,其中(xli,yli)是左上角坐标,(xri,yri)是右下角坐标,则第i个车的位置(x,y)必须满 足xli原创 2016-08-10 22:57:58 · 323 阅读 · 0 评论 -
UVa OJ 714 - Copying Books
UVa OJ 714 - Copying BooksProblem把一个包含m个正整数的序列划分成k个(1≤k≤m≤500)非空的连续子序列,使得每个正 整数恰好属于一个序列。设第i个序列的各数之和为S(i),你的任务是让所有S(i)的最大值尽 量小。例如,序列1 2 3 2 5 4划分成3个序列的最优方案为1 2 3 | 2 5 | 4,其中S(1)、S(2)、S(3) 分别为6、7、4,最大值为原创 2016-09-01 20:59:41 · 444 阅读 · 0 评论 -
UVa OJ 10954 - Add All
UVa OJ 10954 - Add AllProblem有n(n≤5000)个数的集合S,每次可以从S中删除两个数,然后把它们的和放回集合, 直到剩下一个数。每次操作的开销等于删除的两个数之和,求最小总开销。所有数均小于 105。 InputEach test case will start with a positive number, N (2 ≤ N ≤ 5000) followed by原创 2016-09-03 22:38:22 · 304 阅读 · 0 评论 -
UVa OJ 1609 - Foul Play
UVa OJ 1609 - Foul PlayProblemn支队伍(2≤n≤1024,且n是2的整数幂)打淘汰赛,每轮都是两两配对,胜者进入下一轮。每支队伍的实力固定,并且已知每两支队伍之间的一场比赛结果。你喜欢1号队。虽然它不一定是最强的,但是它可以直接打败其他队伍中的至少一半,并且对于每支1号队不能直接打败的队伍t,总是存在一支1号队能直接打败的队伍t’使得t’能直接打败t。问:是否存在一种比原创 2016-09-16 16:08:04 · 339 阅读 · 0 评论 -
UVa OJ 12627 - Erratic Expansion
UVa OJ 12627 - Erratic ExpansionProblem这个问题要带图才能方便理解题意,这里为了节省时间,大家自己去网站看题目就好。我真是太懒了 :p InputThe first line of input is an integer T (T < 1000) that indicates the number of test cases. Each case contai原创 2016-09-04 18:16:20 · 460 阅读 · 0 评论 -
UVa OJ 11054 - Wine trading in Gergovia
UVa OJ 11054 - Wine trading in GergoviaProblemAs you may know from the comic “Asterix and the Chieftain’s Shield”, Gergovia consists of one street, and every inhabitant of the city is a wine salesman.原创 2016-08-14 10:34:58 · 426 阅读 · 0 评论 -
UVa OJ 1220 - Party at Hali-Bula
UVa OJ 1220 - Party at Hali-BulaProblemHere is the: problem linkSolution这道题目一开始没有用f[][]来标记是否重复,导致WA了一次,后来就加上去了。另外,在处理人名时,虽然实例输入里,上司和下属名字出现是有先后的,但是提交之后,系统的测试数据貌似不一定是这样,所以要先判断是否出现,没出现就用cnt加1再赋值递归的思路还是不难的原创 2016-09-30 23:03:29 · 388 阅读 · 0 评论