2014年10月_左眼皮跳跳~

原创 HDU 1022 Train Problem I（stack）

Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is t

2014-10-31 22:11:17 739

原创 HDU 1237 简单计算器（stack）

Problem Description读入一个只包含 +, -, *, / 的非负整数计算表达式，计算该表达式的值。 Input测试输入包含若干测试用例，每个测试用例占一行，每行不超过200个字符，整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束，相应的结果不要输出。 Output对每个测试用例输出1行，即该表达式的值，精确到小数

2014-10-31 21:31:18 1019

原创 ZOJ 3647 Gao the Grid（居然是暴力）

A n * m grid as follow: Count the number of triangles, three of whose vertice must be grid-points.Note that the three vertice of the triangle must not be in a line(the right picture is not a

2014-10-31 19:38:47 1310

原创 HDU 5083 Instruction（字符串处理）

Problem DescriptionNowadays, Jim Green has produced a kind of computer called JG. In his computer, the instruction is represented by binary code. However when we code in this computer, we use some m

2014-10-26 10:43:55 1366

原创 POJ 2777 Count Color（线段树）

Language:DefaultCount ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36180 Accepted: 10927DescriptionChosen Problem Solving and Program desi

2014-10-24 14:34:08 927

原创 POJ 3667 Hotel （线段树区间合并）

Language:DefaultHotelTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 12417 Accepted: 5346DescriptionThe cows are journeying north to Thunder Bay i

2014-10-24 11:34:02 1653

原创 poj 3263 Tallest Cow（线段树）

Language:DefaultTallest CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1964 Accepted: 906DescriptionFJ's N (1 ≤ N ≤ 10,000) cows conveniently

2014-10-23 21:18:16 1505

原创 POJ 2828 Buy Tickets（线段树）

Language:DefaultBuy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 13847 Accepted: 6926DescriptionRailway tickets were difficult to buy ar

2014-10-23 20:28:42 868

原创 HDU 5073 Galaxy（居然是暴力）

Problem DescriptionGood news for us: to release the financial pressure, the government started selling galaxies and we can buy them from now on! The first one who bought a galaxy was Tianming Yun an

2014-10-23 19:32:41 947

原创 POJ 2528 Mayor's posters（线段树+离散化）

Language:DefaultMayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 43702 Accepted: 12763DescriptionThe citizens of Bytetown, AB, could

2014-10-23 18:50:43 807

原创 HDU 5074 Hatsune Miku（dp）

Problem DescriptionHatsune Miku is a popular virtual singer. It is very popular in both Japan and China. Basically it is a computer software that allows you to compose a song on your own using the v

2014-10-23 17:38:22 825

原创 HDU 2087 剪花布条（kmp）

Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？ Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长

2014-10-21 22:16:12 761

原创 HDU 3336 Count the string（kmp）

Problem DescriptionIt is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. F

2014-10-21 21:12:15 832

原创 HDU 2203 亲和串（kmp）

Problem Description人随着岁数的增长是越大越聪明还是越大越笨，这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考，因为他在很小的时候就知道亲和串如何判断了，但是发现，现在长大了却不知道怎么去判断亲和串了，于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。亲和串的定义是这样的：给定两个字符串s1和s2,如果能通过s1循环移位，使s2包含在s1中，那么

2014-10-21 20:30:45 1012

原创 HDU 1711 Number Sequence（kmp）

Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b

2014-10-21 20:10:14 879

原创 HDU 1686 Oulipo（kmp）

Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pa

2014-10-21 19:36:32 793

原创 ZOJ 2319 Beautiful People（LIS二分法+路径输出）

Beautiful PeopleTime Limit: 5 Seconds Memory Limit: 32768 KB Special Judge The most prestigious sports club in one city has exactly N members. Each of its members is strong and b

2014-10-20 22:15:18 924

原创 POJ 1631 Bridging signals（LIS 二分快速方法）

Language:DefaultBridging signalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10762 Accepted: 5899Description'Oh no, they've done it again', cri

2014-10-19 15:40:14 1520

原创 POJ 1887 Testing the CATCHER（LIS的反面最大递减子序列）

Language:DefaultTesting the CATCHERTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15207 Accepted: 5595DescriptionA military contractor for the De

2014-10-19 10:41:22 1187

原创 POJ 2533 Longest Ordered Subsequence（dp LIS）

Language:DefaultLongest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 33986 Accepted: 14892DescriptionA numeric sequence of a

2014-10-19 10:35:12 934

原创 HDU 2955 Robberies（dp）

Problem 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 they become too greedy. He has decided to

2014-10-18 23:13:38 781

原创 POJ 1742 Coins（dp）

Language:DefaultCoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 29278 Accepted: 9916DescriptionPeople in Silverland use coins.They have coins

2014-10-18 22:46:28 783

原创 HDU 1159 Common Subsequence（dp LCS）

Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exi

2014-10-18 21:15:37 750

原创 HDU 1203 I NEED A OFFER!（dp）

Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他的经济承受范围内）。每个学校都有不同的申请费用a（万美元），并且Speakless估计了他得

2014-10-17 22:44:47 969

原创 HDu 2830 Matrix Swapping II（dp）

Problem DescriptionGiven an N * M matrix with each entry equal to 0 or 1. We can find some rectangles in the matrix whose entries are all 1, and we define the maximum area of such rectangle as this

2014-10-17 21:40:15 966

原创 HDU 2845 Beans（dp）

Problem DescriptionBean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 grid. Now you want to

2014-10-17 21:31:16 1244

原创 HDU 1056 Largest Rectangle in a Histogram（dp）（求最大的矩形面积）

Problem DescriptionA histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figu

2014-10-17 20:07:05 953

原创 POJ 1094 Sorting It All Out（topsort Language: Sorting It All Out Time Limit: 1000MS Memory Limit: ）

Language:DefaultSorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28241 Accepted: 9757DescriptionAn ascending sorted sequence of d

2014-10-16 22:41:00 859

原创 HDU 1811 Rank of Tetris（topsort）

Problem Description自从Lele开发了Rating系统，他的Tetris事业更是如虎添翼，不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好，Lele又想了一个新点子：他将制作一个全球Tetris高手排行榜，定时更新，名堂要比福布斯富豪榜还响。关于如何排名，这个不用说都知道是根据Rating从高到低来排，如果两个人具有相同的Rating，那就按这几个人的RP

2014-10-16 21:50:21 715

原创 poj 2367 Genealogical tree（topsort）

Language:DefaultGenealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3063 Accepted: 2072 Special JudgeDescriptionThe system of Mar

2014-10-16 21:13:02 746

原创 HDU 1505 City Game（01矩阵 dp）

Problem DescriptionBob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees,f

2014-10-14 21:27:48 956

原创 HDU 1257 最少拦截系统（dp）

Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求

2014-10-14 20:59:26 820

原创 HDU 1248 寒冰王座（dp）

Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!"地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水350块一个."死亡骑士:"好的,给我一个血瓶."说完他掏出那张N元

2014-10-14 20:38:52 873

原创 HDU 1058 Humble Numbers（dp）

Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first

2014-10-14 19:48:53 774

原创 poj 1276 Cash Machine（dp 水题）

Language:DefaultCash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27799 Accepted: 9913DescriptionA Bank plans to install a machine for c

2014-10-14 18:56:55 767

原创 poj 3009 Curling 2.0（dfs）

Language:DefaultCurling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11926 Accepted: 5051DescriptionOn Planet MM-21, after their Olympic gam

2014-10-12 22:33:16 817

原创 poj 1321 棋盘问题（dfs）

Language:Default棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23127 Accepted: 11478Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋

2014-10-12 22:24:25 991

原创 poj 1703 Find them, Catch them（并查集）

Language:DefaultFind them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32057 Accepted: 9882DescriptionThe police offic

2014-10-10 18:44:38 750

空空如也

空空如也