左眼皮跳跳

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=2577zuoc

最大连续子序列，输出最大值和首尾元素

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

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

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

HDU 2870 (最大0 1 矩阵面积)

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

Language:DefaultExact Change OnlyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2584 Accepted: 883DescriptionBoudreaux reached over and shook awa

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

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

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

Problem DescriptionIn computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to hig

Language:DefaultMultiplication PuzzleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6693 Accepted: 4083DescriptionThe multiplication puzzle is pl

Language:DefaultRunningTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5300 Accepted: 1974DescriptionThe cows are trying to become better athletes

Language:DefaultCheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6227 Accepted: 3032DescriptionKeeping track of all the cows can

Problem DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can chan

BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3571 Accepted: 1847DescriptionWe give the following inductive definition of a “regular brack

Language:DefaultBrackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26424 Accepted: 7451 Special JudgeDescriptionLet us define a

Language:DefaultBalancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9418 Accepted: 3941DescriptionConsider a tree T with N (1 <= N <= 20,

Language:DefaultAnniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4594 Accepted: 2607DescriptionThere is going to be a party to cel

Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the superviso

A school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Ma

1057. Amount of DegreesTime limit: 1.0 secondMemory limit: 64 MBCreate a code to determine the amount of integers, lying in the set [X;Y] and being a sum of exactlyK different integer de

Problem I: 游戏王Description小学的时候，Stubird非常喜欢玩游戏王，有一天，他发现了一个绝佳的连锁组合，这个连锁组合需要6张卡， 可是他一张都没有，但是他的那些朋友们有，不过当然，他们不会白给，不过也不排除有人和他交情好，送给他了。 不过他们有成全别人的美德，当他们看到Stubird已经有某些他们喜欢的卡的时候，他们会给他优惠，或者更贵也说不定 嘛

Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如：62315 73418 88914都属于不吉利号码。但是，61152虽然含有6和

Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped

Problem DescriptionFor a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + ... + A2 * 2 + A1 * 1. Now you are given two numbers A and B

Problem DescriptionRompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings. His thinking circuit was changed by human and

Problem DescriptionThe counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the curren

时间限制：1 秒内存限制：128 兆特殊判题：否提交：3468解决：291题目描述：给定一个数组，判断数组内是否存在一个连续区间，使其和恰好等于给定整数k。输入：输入包含多组测试用例，每组测试用例由一个整数n(1接下去一行为n个整数，描述这个数组，整数绝对值不大于100。最后一行为一个整数k(大小在int范

Language:DefaultMondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 12405 Accepted: 7239DescriptionSquares and rectangles fascinated

Language:DefaultCorn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8704 Accepted: 4641DescriptionFarmer John has purchased a lush new rect

Problem DescriptionAs one of the most powerful brushes in the world, zhx usually takes part in all kinds of contests.One day, zhx takes part in an contest. He found the contest very easy for him.

Language:DefaultCheck the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5419 Accepted: 2384DescriptionOrganizing a program

Language:DefaultMondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 12403 Accepted: 7237DescriptionSquares and rectangles fascinated

Problem DescriptionWe wish to tile a grid 4 units high and N units long with rectangles (dominoes) 2 units by one unit (in either orientation). For example, the figure shows the five different ways

Language:DefaultScout YYF ITime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5504 Accepted: 1522DescriptionYYF is a couragous scout. Now he is on a

Language:DefaultCollecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 2965 Accepted: 1462Case Time Limit: 2000MS Special JudgeDesc

Language:Default炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20502 Accepted: 7944Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图

Problem DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not