ACM,再见！

http://poj.org/problem?id=1088DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子  1 2 3 4 5

http://poj.org/problem?id=1321Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一个空格隔开

http://acm.hdu.edu.cn/showproblem.php?pid=1248Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!"地精商人:"我们这里有三种道具,血瓶150块一个,魔法

http://acm.hdu.edu.cn/showproblem.php?pid=1159Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = an

http://acm.hdu.edu.cn/showproblem.php?pid=2602Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bone

http://poj.org/problem?id=3624DescriptionBessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ 

http://acm.hdu.edu.cn/showproblem.php?pid=1466Problem Description平面上有n条直线，且无三线共点，问这些直线能有多少种不同交点数。比如,如果n=2,则可能的交点数量为0(平行)或者1(不平行)。 Input输入数据包含多个测试实例,每个测试实例占一行,每行包含一个正整数n（n

http://acm.hdu.edu.cn/showproblem.php?pid=2059Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心中郁闷，发誓要报仇雪恨，于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼，终于练成了绝技，能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟，以雪前

http://acm.hdu.edu.cn/showproblem.php?pid=1176Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接

http://acm.hdu.edu.cn/showproblem.php?pid=2151Problem Description自从见识了平安夜苹果的涨价后，Lele就在他家门口水平种了一排苹果树，共有N棵。突然Lele发现在左起第P棵树上(从1开始计数)有一条毛毛虫。为了看到毛毛虫变蝴蝶的过程，Lele在苹果树旁观察了很久。虽然没有看到蝴蝶，但Lele发现了

http://poj.org/problem?id=1036DescriptionN gangsters are going to a restaurant. The i-th gangster comes at the time Ti and has the prosperity Pi. The door of the restaurant has K+1 states of o

http://acm.hdu.edu.cn/showproblem.php?pid=1203Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若

#include #include #include using namespace std;int dp[10005], w[10005],v[10005];int main(){ int n,m,y; cin >> y; while(y--) { memset(dp,0,sizeof(dp)); scanf("%d%d

http://acm.hdu.edu.cn/showproblem.php?pid=1081Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or

http://acm.hdu.edu.cn/showproblem.php?pid=1503Problem DescriptionThe company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into t

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=167 Testing the CATCHER A military contractor for the Department of Defense h

http://poj.org/problem?id=1952DescriptionThe advice to "buy low" is half the formula to success in the bovine stock market.To be considered a great investor you must also follow this problems'

http://codeforces.com/problemset/problem/416/B

http://acm.hrbust.edu.cn/contests/index.php?act=showproblem&cid=250&p=FF.背包Time Limit: 5000 MSMemory Limit: 32768 KTotal Submit: 117 (38 users)Total Accep

Problem 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

http://acm.hdu.edu.cn/showproblem.php?pid=1244Problem Description给定一个由n个正整数组成的整数序列a1 a2 a3 ... an求按先后次序在其中取m段长度分别为l1、l2、l3...lm的不交叠的连续整数的和的最大值。 Input第一行是一个整数n(0 ≤ n ≤

TripTime Limit 1000msMemory Limit 65536Kdescription　　Xiao wang has a new car, so he wants to have a trip from his home to hefei, however, ther

http://codeforces.com/problemset/problem/189/AA. Cut Ribbontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

http://acm.hdu.edu.cn/showproblem.php?pid=1087Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, an

http://acm.hdu.edu.cn/showproblem.php?pid=2571Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机关。要知道，不论何人，若在迷宫中被困1小时以上，则必死无疑！可怜的yifenfei

http://acm.hdu.edu.cn/showproblem.php?pid=1069Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a build

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1884

http://codeforces.com/contest/447/problem/C

http://vjudge.net/contest/view.action?cid=47807#problem/DDescriptionThis problem differs from one which was on the online contest.The sequence a1, a2, ..., an is called increasing, if ai

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1672A sequence of integer numbers a1 , a2 , ..., an is called a Fibonacci sequence if ai = ai-2+ai-1 for all i=3,4,...,n.Given a sequ

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2257

#include #include #include #include #include #include #include using namespace std;string s1,s2;string lcs2(string s1,string s2){ if(s1==""||s2=="") return ""; int m=s1.size(

http://vjudge.net/contest/view.action?cid=53516#problem/BDescription  Problem EPrince and PrincessInput: Standard InputOutput: Standard OutputTime Limit: 3 Seconds In an n

http://acm.hdu.edu.cn/showproblem.php?pid=4800

http://vjudge.net/contest/view.action?cid=53516#problem/CDescriptionProblem EGame of SumInput File: e.inOutput: Standard Output This is a two player game. Initially there are n int

http://acm.hdu.edu.cn/showproblem.php?pid=1025Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half o

http://vjudge.net/vjudge/contest/view.action?cid=53516#problem/D

http://vjudge.net/vjudge/contest/view.action?cid=53516#problem/EDescriptionInput: Standard InOutput: Standard OutNext Generation Contest 1 Time Limit: 2 seconds

http://www.spoj.com/problems/AMR11A/

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2631