剑洋侠客

悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13952    Accepted Submission(s): 5868Problem Description急！灾

Stock ExchangeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4090 Accepted: 1471DescriptionThe world financial crisis is quite a subject. Some people are

RP问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 826 Accepted Submission(s): 266Problem Description在人类社会中，任何个体都具有人品，人品有各种不同的形式，可以从一种

Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22397 Accepted: 10049DescriptionBessie has gone to the mall's jewelry store and spies a

Revenge of LIS IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 878    Accepted Submission(s): 287Problem DescriptionIn compute

Paint PearlsTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2221    Accepted Submission(s): 719Problem DescriptionLee has a stri

Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11999    Accepted Submission(s): 8494Problem Description

Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5562 Accepted: 2326DescriptionBessie is such a hard-working cow. In fact, she is so focused

D. Bad Luck Islandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Bad Luck Island is inhabited by thre

Pascal's Travels Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1682    Accepted Submission(s): 732Problem DescriptionAn n x n game

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 84217 Accepted: 31528DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6904 Accepted: 3348DescriptionKeeping track of all the cows can be a tricky task so F

其实状态压缩dp就是一个普通的dp加一个对集合的操作，只是把这个集合“压缩”一下，所以这里简单说一下怎样表示一个集合以及对它进行操作。首先，我们为什么要状态压缩？因为有时我们需要用东西表示一个集合。比如经典的TSP问题，它需要用到一个集合S来表示已经遍历的点（这些点用不同的数字表示），那么如何来表示集合S呢？这里我们可以利用二进制的方法：将集合中的元素对应二进制中的1，其它的为0，这样就产生了

Wang Xifeng's Little PlotTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 751    Accepted Submission(s): 461Problem Description《D

CakeTime Limit: 4 Seconds      Memory Limit: 65536 KBAlice and Bob like eating cake very much. One day, Alice and Bob went to a bakery and bought many cakes.Now we know that they have bought

描述在遥远的未来，小Hi成为了地球联邦外空间联合开发工作组的一员，前往一颗新发现的星球开发当地的重金属资源。为了能够在当地生存下来，小Hi首先要建立一个基地。建立基地的材料可以直接使用当地的石材和富裕的重金属资源。基地建设分为N级，每一级都需要达成K的建设值后才能够完成建设，当前级别的建设值溢出后不会影响到下一级的建设。小Hi可以产出的重金属资源按照精炼程度分为M级，根据开

题目链接：http://hihocoder.com/problemset/problem/1364描述小Hi在游乐园中获得了M张奖券，这些奖券可以用来兑换奖品。可供兑换的奖品一共有N件。第i件奖品需要Wi张奖券才能兑换到，其价值是Pi。  小Hi使用不超过M张奖券所能兑换到的最大奖品总价值是多少？输入第一行两个整数N，M。  接下来N行，每行两个整数Wi

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22542    Accepted Submission(s): 9888Problem DescriptionA subseque

Problem 2177 ytaaaAccept: 4    Submit: 7Time Limit: 2000 mSec    Memory Limit : 32768 KB Problem DescriptionYtaaa作为一名特工执行了无数困难的任务，这一次ytaaa收到命令，需要炸毁敌人的一个工厂，为此ytaaa需要制造一批炸弹以供使用。 Ytaaa使用的这种

Piggy-BankTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10943    Accepted Submission(s): 5529Problem DescriptionBefore ACM can do

数塔Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21157    Accepted Submission(s): 12708Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，

Employment PlanningTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3649    Accepted Submission(s): 1499Problem DescriptionA project

FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9284    Accepted Submission(s): 4125Special JudgeProblem Description

I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16236    Accepted Submission(s): 6461Problem DescriptionSpeakless很早就想

免费馅饼Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25717    Accepted Submission(s): 8764Problem Description都说天上不会掉馅饼，但有一天gameboy正走在

Function Run FunTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2188    Accepted Submission(s): 1112Problem DescriptionWe all love r

FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4884    Accepted Submission(s): 1987Problem DescriptionFatMouse h

写这题花了我一天时间，而且还没写出来，故

Distribute MessageTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1311    Accepted Submission(s): 604Problem DescriptionThe contest’

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7559    Accepted Submission(s): 3896Problem DescriptionA group

DividingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16994    Accepted Submission(s): 4753Problem DescriptionMarsha and Bill

问题:有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。这些物品被划分为若干组，每组中的物品互相冲突，最多选一件。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。算法这个问题变成了每组物品有若干种策略：是选择本组的某一件，还是一件都不选。也就是说设f[k][v]表示前k组物品花费费用v能取得的最大权值，则有：f[k][v]=ma

小兔的棋盘Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6628    Accepted Submission(s): 3580Problem Description小兔的叔叔从外面旅游回来给她带来了一个礼

#1285 : 智力竞赛时间限制:5000ms单点时限:1000ms内存限制:256MB描述小Hi、小Ho还有被小Hi强拉来的小Z，准备组队参加一个智力竞赛。竞赛采用过关制，共计N个关卡。在第i个关卡中，小Hi他们需要获得Ai点分数才能够进入下一关。每一关的分数都是独立计算的，即使在一关当中获得超过需要的分数，也不会对后面的关卡产生影响。