08 2015 档案

ACM 歌曲边下边听问题
摘要：Little Lesha loves listening to music via his smartphone. But the smartphone doesn't have much memory, so Lesha listens to his favorite songs in a wel... 阅读全文
posted @ 2015-08-21 20:49 心向晴 阅读(154) 评论(0) 推荐(0) 编辑
ACM 组队交朋友
摘要：Descriptionnparticipants of the competition were split intomteams in some manner so that each team has at least one participant. After the competition... 阅读全文
posted @ 2015-08-21 19:49 心向晴 阅读(233) 评论(0) 推荐(0) 编辑
ACM 线性规划
摘要：DescriptionYou are going from Dhaka to Chittagong by train and you came to know one of your old friends is goingfrom city Chittagong to Sylhet. You al... 阅读全文
posted @ 2015-08-20 11:35 心向晴 阅读(845) 评论(0) 推荐(0) 编辑
ACM 概率&&动态规划
摘要：DescriptionAs Harry Potter series is over, Harry has no job. Since he wants to make quick money, (he wants everything quick!) so he decided to rob ban... 阅读全文
posted @ 2015-08-19 21:22 心向晴 阅读(335) 评论(0) 推荐(0) 编辑
ACM 数论 质因数分解
摘要：DescriptionTomorrow is contest day, Are you all ready?We have been training for 45 days, and all guys must be tired.But , you are so lucky comparing w... 阅读全文
posted @ 2015-08-19 17:16 心向晴 阅读(2897) 评论(0) 推荐(0) 编辑
ACM 计数
摘要：DescriptionGerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to. Then he measured the... 阅读全文
posted @ 2015-08-19 15:51 心向晴 阅读(334) 评论(0) 推荐(0) 编辑
ACM 概率
摘要：DescriptionSometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party whe... 阅读全文
posted @ 2015-08-19 15:14 心向晴 阅读(687) 评论(0) 推荐(0) 编辑
ACM矩形嵌套问题LIS
摘要：Description一组研究人员正在设计一项实验，以测试猴子的智商。他们将挂香蕉在建筑物的屋顶，同时，提供一些砖块给这些猴子。如果猴子足够聪明，它应当能够通过合理的放置一些砖块建立一个塔，并爬上去吃他们最喜欢的香蕉。研究人员有n种类型的砖块，每种类型的砖块都有无限个。第i块砖块的长宽高分别用xi，... 阅读全文
posted @ 2015-08-19 10:44 心向晴 阅读(330) 评论(0) 推荐(0) 编辑
ACM 编辑距离
摘要：DescriptionLetxandybe two strings over some finite alphabetA. We would like to transformxintoyallowing only operations given below:Deletion:a letter i... 阅读全文
posted @ 2015-08-18 20:38 心向晴 阅读(323) 评论(0) 推荐(0) 编辑
ACM线性方程
摘要：DescriptionThe Sky is Sprite.The Birds is Fly in the Sky.The Wind is Wonderful.Blew Throw the TreesTrees are Shaking, Leaves are Falling.Lovers Walk p... 阅读全文
posted @ 2015-08-18 17:21 心向晴 阅读(298) 评论(0) 推荐(0) 编辑
ACM 错排
摘要：Description大家常常感慨，要做好一件事情真的不容易，确实，失败比成功容易多了！做好“一件”事情尚且不易，若想永远成功而总从不失败，那更是难上加难了，就像花钱总是比挣钱容易的道理一样。话虽这样说，我还是要告诉大家，要想失败到一定程度也是不容易的。比如，我高中的时候，就有一个神奇的女生，在英语... 阅读全文
posted @ 2015-08-18 17:11 心向晴 阅读(370) 评论(0) 推荐(0) 编辑
ACM 辗转相除法（求最大公约数 ）
摘要：DescriptionThere is a hill with n holes around. The holes are signed from 0 to n-1.A rabbit must hide in one of the holes. A wolf searches the rabbit ... 阅读全文
posted @ 2015-08-17 22:17 心向晴 阅读(510) 评论(0) 推荐(0) 编辑
ACM 3.2 素数筛选法
摘要：Description 小明对数的研究比较热爱，一谈到数，脑子里就涌现出好多数的问题，今天，小明想考考你对素数的认识。 问题是这样的：一个十进制数，如果是素数，而且它的各位数字和也是素数，则称之为“美素数”，如29，本身是素数，而且2+9 = 11也是素数，所以它是美素数。 给定一个区间，你能... 阅读全文
posted @ 2015-08-17 22:12 心向晴 阅读(226) 评论(0) 推荐(0) 编辑
ACM 记忆化搜索
摘要：I -记忆化搜索Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你... 阅读全文
posted @ 2015-08-15 16:46 心向晴 阅读(255) 评论(0) 推荐(0) 编辑
ACM dp问题 给房子涂色
摘要：DescriptionThe people ofMohammadpurhave decided to paint each of their houses red, green, or blue. They've also decided that no two neighboring houses... 阅读全文
posted @ 2015-08-15 16:17 心向晴 阅读(438) 评论(0) 推荐(0) 编辑
ACM 01背包HDU 1203
摘要：DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他的经济承受范... 阅读全文
posted @ 2015-08-14 21:51 心向晴 阅读(503) 评论(0) 推荐(0) 编辑
ACM最大公共子序列&&回文串
摘要：---恢复内容开始---DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You ... 阅读全文
posted @ 2015-08-14 19:31 心向晴 阅读(368) 评论(0) 推荐(0) 编辑
ACM 回文串&最大公共子序列
摘要：DescriptionBy definition palindrome is a string which is not changed when reversed."MADAM"is a nice example of palindrome. It is an easy job to test w... 阅读全文
posted @ 2015-08-14 19:25 心向晴 阅读(260) 评论(0) 推荐(0) 编辑
ACM 最大公共子序列
摘要：DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence... 阅读全文
posted @ 2015-08-14 19:12 心向晴 阅读(273) 评论(0) 推荐(0) 编辑
ACM LIS 最长子序列问题
摘要：E -LISTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe world financial crisis is quite a subject. Some peo... 阅读全文
posted @ 2015-08-13 11:14 心向晴 阅读(439) 评论(0) 推荐(0) 编辑
ACM 01背包问题1
摘要：DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as do... 阅读全文
posted @ 2015-08-12 21:03 心向晴 阅读(248) 评论(0) 推荐(0) 编辑
ACM 01背包问题
摘要：DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because th... 阅读全文
posted @ 2015-08-12 20:53 心向晴 阅读(292) 评论(0) 推荐(0) 编辑
矩形嵌套问题
摘要：描述有n个矩形，每个矩形可以用a,b来描述，表示长和宽。矩形X(a,b)可以嵌套在矩形Y(c,d)中当且仅当a#includeusing namespace std;#define MAXN 1000int g[101][101],t[MAXN+1],n;int Max(int a,int b)//... 阅读全文
posted @ 2015-08-11 20:22 心向晴 阅读(978) 评论(0) 推荐(0) 编辑
ACM最大子串和问题
摘要：DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the ma... 阅读全文
posted @ 2015-08-10 20:40 心向晴 阅读(1370) 评论(0) 推荐(0) 编辑
ACM装箱问题
摘要：DescriptionA set ofn1-dimensional items have to be packed in identical bins. All bins have exactly the same lengthland each itemihas lengthlil. We loo... 阅读全文
posted @ 2015-08-10 16:42 心向晴 阅读(342) 评论(0) 推荐(0) 编辑
ACM田胫赛马
摘要：DescriptionHere 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 t... 阅读全文
posted @ 2015-08-10 15:22 心向晴 阅读(270) 评论(0) 推荐(0) 编辑
ACM雷达安放问题
摘要：DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating ... 阅读全文
posted @ 2015-08-09 20:35 心向晴 阅读(391) 评论(0) 推荐(0) 编辑
ACM找出一串数字是否能被分成两部分使其中一部分全部为负数，加上另一部分可以为0
摘要：DescriptionMost financial institutions had become insolvent during financial crisis and went bankrupt or were bought by larger institutions, usually b... 阅读全文
posted @ 2015-08-09 20:06 心向晴 阅读(361) 评论(0) 推荐(0) 编辑
ACM草地上洒水需要的最少的喷泉数
摘要：n sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler is installed at the horizontal center line o... 阅读全文
posted @ 2015-08-09 18:00 心向晴 阅读(467) 评论(0) 推荐(0) 编辑
ACM求经过k次移动后所得的逆序数
摘要：Descriptionbobo has a sequence a1,a2,…,an. He is allowed to swap twoadjacentnumbers for no more than k times.Find the minimum number of inversions aft... 阅读全文
posted @ 2015-08-08 15:41 心向晴 阅读(261) 评论(0) 推荐(0) 编辑
ACM求路灯照射的最小半径问题
摘要：---恢复内容开始---DescriptionVanya walks late at night along a straight street of lengthl, lit bynlanterns. Consider the coordinate system with the beginnin... 阅读全文
posted @ 2015-08-07 20:04 心向晴 阅读(505) 评论(0) 推荐(0) 编辑
ACM
摘要：DescriptionOnce Bob took a paper stripe ofnsquares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negativ... 阅读全文
posted @ 2015-08-07 19:39 心向晴 阅读(177) 评论(0) 推荐(0) 编辑
ACM最大值最小化&&二分法
摘要：DescriptionBefore the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so calle... 阅读全文
posted @ 2015-08-06 20:52 心向晴 阅读(791) 评论(0) 推荐(0) 编辑
ACM二分法分饼问题
摘要：My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F... 阅读全文
posted @ 2015-08-06 16:46 心向晴 阅读(1219) 评论(0) 推荐(1) 编辑
ACM贪心覆盖问题
摘要：Given several segments of line (int the X axis) with coordinates [Li , Ri ]. You are to choose the minimal amount of them, such they would completely ... 阅读全文
posted @ 2015-08-06 12:54 心向晴 阅读(321) 评论(0) 推荐(0) 编辑
ACM归并排序
摘要：In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacen... 阅读全文
posted @ 2015-08-04 16:34 心向晴 阅读(285) 评论(0) 推荐(0) 编辑