linyuxilu的博客

最大连续子序列 HDU - 1231 分析：注意：若所有K个元素都是负数，则定义其最大和为0，输出整个序列的首尾元素。#includeint t,n,v[100010],a,b,m;int f(int v[] ){ int c=0,d=1,i; for(i=0; i<t; i++) { c+=v[i];//累加连续和

In a few months the European Currency Union will become a reality. However, to join the club, theMaastricht criteria must be fulfilled, and this is not a trivial task for the countries (maybe except

DescriptionBackgroundProblems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing probl

Michael likes snowboarding. That’s not very surprising, since snowboarding is really great. The badthing is that in order to gain speed, the area must slide downwards. Another disadvantage is that w

Wavio is a sequence of integers. It has some interesting properties.• Wavio is of odd length i.e. L = 2 ∗ n + 1.• The first (n + 1) integers of Wavio sequence makes a strictly increasing sequence.

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 max sum in this sequence is 6 + (-1) + 5 + 4

DescriptionDilworth is the world’s most prominent collector of Russian nested dolls: he literally has thousands of them! You know, the wooden hollow dolls of different sizes of which the small

DescriptionThere is a string S.S only contain lower case English character.(10 \leq length(S) \leq 1,000,000) How many substrings there are that contain at least k(1 \leq k \leq 26) distin

C - Audiophobia  Consider yourself lucky! Consider yourself lucky to be still breathing and having fun participating in this contest. But we apprehend that many of your descendants may not hav

DescriptionIt's commonly known that the Dutch have invented copper-wire. Two Dutch men were fighting over a nickel, which was made of copper. They were both so eager to get it and the figh

DescriptionBackgroundMany problems in Computer Science involve maximizing some measure according to constraints.Consider a history exam in which students are asked to put several histori

InputInput consists of pairs of lines. The first line of a pair contains the first string and the second linecontains the second string. Each string is on a separate line and consists of at most 1,0

DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divide

DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in th

Description“今年暑假不AC？” “是的。” “那你干什么呢？” “看世界杯呀，笨蛋！” “@#$%^&*%...” 确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。 作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，比如新闻联播（永远不要忘记关心国家大事）、非常6+7、超级

DescriptionAfter making a purchase at a large department store, Mel's change was 17 cents. He received 1 dime, 1 nickel, and 2 pennies. Later that day, he was shopping at a convenience store.

You 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 being cut. Their procedure of work

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

The company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doesn't work, but sometime

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36107    Accepted Submission(s): 16464Problem Descri

题目描述Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College

题目B      剁手党                               限时：2000ms剁手党们整天游荡在各种大小商场，有N种物品，每种物品的数量为C1，C2......Cn。从中任选若干件放在容量为W的背包里，每种物品的体积为W1，W2......Wn（Wi为整数），与之相对应的价值为P1,P2......Pn（Pi为整数）。求背包能够容纳的最大价值。 输

DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very proud

DescriptionJohn is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at l

题目描述The 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 work in the

River Crossing                                                                        时间限制：1000 ms  |  内存限制：65535 KB      难度：4描述Afandi is herding N sheep across the expanses of grassland  when

Adjacent Bit Counts                                                                     时间限制：1000 ms  |  内存限制：65535 KB  难度：4描述For a string of n bits x1, x2, x3, …, xn,  the adjacent bit count

BOBSLEDDING时间限制：1000 ms  |  内存限制：65535 KB难度：3描述Dr.Kong has entered a bobsled competition because he hopes his hefty weight will give his an advantage over the L meter course

In this problem you are asked to convert a string into a palindrome with minimum number of operations. The operations are described below:Here you’d have the ultimate freedom. You are allowed to:

AMAZING AUCTION时间限制：3000 ms  |  内存限制：65535 KB难度：4描述Recently the auction house has introduced a new type of auction, the lowest price auction. In this new system, people compete for the l

矩阵最少乘法题意：给你2个矩阵A、B，我们使用标准的矩阵相乘定义C=AB如下：A阵列中栏（column）的数目一定要等于B阵列中列（row）的数目才可以做此2阵列的相乘。若我们以rows(A)，columns(A)分别代表A阵列中列及栏的数目，要计算C阵列共需要的乘法的数目为：rows(A)*columns(B)*columns(A)。例如：A阵列是一个

Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial CityWall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in

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 in the sea side. And any radar install

逆波兰表达式     正常的表达式称为中缀表达式，运算符在中间，主要是给人阅读的，机器求解并不方便。    例如：3 + 5 * (2 + 6) - 1    而且，常常需要用括号来改变运算次序。    相反，如果使用逆波兰表达式（前缀表达式）表示，上面的算式则表示为：     - + 3 * 5 + 2 6 1    不再需要括号，机器可以用递归的方法很方便地求解。

打印大X小明希望用星号拼凑，打印出一个大X，他要求能够控制笔画的宽度和整个字的高度。为了便于比对空格，所有的空白位置都以句点符来代替。要求输入两个整数m n，表示笔的宽度，X的高度。用空格分开(0要求输出一个大X例如，用户输入：3 9程序应该输出：***.....***.***...***...***.***.....*****.......**

/先说汉若塔I（经典汉若塔问题），有三塔，A塔从小到大从上至下放有N个盘子，现在要搬到目标C上，规则小的必需放在大的上面，每次搬一个，求最小步数。这个问题简单，DP：a[n]=a[n-1]+1+a[n-1],先把上面的n-1个放在B上，把最大的放在目标C上，再把N-1个放回到C上即可B - 汉诺塔IITime Limit:1000MS     Memory

D - Big Event in HDUTime Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNowadays, we all know that Computer College is the biggest d

C - Proud MerchantsTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionRecently, iSea went to an ancient country. For such a long ti

B - Bone CollectorDescriptionMany 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 dog’s , cow’s , al

T - 骆驼猜名字Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescription今年暑假杭电ACM集训队第一次组成女生队,其中有一队叫RPG,但做为集训队成员之一的野骆驼竟然不知道RPG三个人具体是谁谁。RPG给他机会让他猜猜