我家小破孩儿

摘要： 最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16819Accepted Submission(s): 7387Problem Description给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj }，其中 1 using namespace std;int main(){ int n,i,s[10001],a[10001],f[10001],max,st 阅读全文

摘要： Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3365Accepted Submission(s): 1062Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.InputEach 阅读全文

摘要： 最大的最小公倍数Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 175(50 users)Total Accepted: 48(38 users)Rating: Special Judge: NoDescription从小学我们就学过最小公倍数，今天这个问题也是关于最小公倍数lcm (lease common multiple)的。我们的问题是，给定一个整数n后，你需要任取三个不大于n的数，取法不限，每个数可取多个，使得取到的这三个数的最小公倍数在所有取法中是最大的。举个例子：给定的n是5。那么不大于5的可选数为1、2、3、4、5。这 阅读全文

摘要： 饭卡Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8554Accepted Submission(s): 2920 Problem Description电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。 某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格 阅读全文

摘要： HDU TodayTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11627Accepted Submission(s): 2713Problem Description经过锦囊相助，海东集团终于度过了危机，从此，HDU的发展就一直顺风顺水，到了2050年，集团已经相当规模了，据说进入了钱江肉丝经济开发区500强。这时候，XHD夫妇也退居了二线，并在风景秀美的诸暨市浬浦镇陶姚村买了个房子，开始安度晚年了。这样住了一段时间，徐总对当地的交通还是 阅读全文

摘要： Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6176Accepted Submission(s): 2889Problem DescriptionNow,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try yo 阅读全文

摘要： Can you find it?Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 8566Accepted Submission(s): 2237Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three number 阅读全文

摘要： SORT AGAINTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3480Accepted Submission(s): 1108Problem Description给你N个整数,x1,x2...xn，任取两个整数组合得到|xi-xj|,(0#include#include#includeusing namespace std;int main(){ int c,n,k,i,l,j,a[1011],hash[2222],b[2222]; s 阅读全文

摘要： A simple problemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2786Accepted Submission(s): 979Problem DescriptionZty很痴迷数学问题.。一天，yifenfei出了个数学题想难倒他，让他回答1 / n。但Zty却回答不了^_^. 请大家编程帮助他.Input第一行整数T，表示测试组数。后面T行，每行一个整数 n (1#include#includeusing namespace 阅读全文

摘要： A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each person has a different rowing speed; the speed of a couple i 阅读全文